pub struct ProofTree {
pub conclusion: Sequent,
pub rule: InferenceRule,
pub premises: Vec<ProofTree>,
}Expand description
A proof tree in sequent calculus.
Represents a derivation tree showing how a sequent is proved using inference rules applied to premises.
Fields§
§conclusion: SequentThe conclusion sequent of this proof step
rule: InferenceRuleThe inference rule applied
premises: Vec<ProofTree>Premise proof trees (subproofs)
Implementations§
Trait Implementations§
Source§impl<'de> Deserialize<'de> for ProofTree
impl<'de> Deserialize<'de> for ProofTree
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
impl StructuralPartialEq for ProofTree
Auto Trait Implementations§
impl Freeze for ProofTree
impl RefUnwindSafe for ProofTree
impl Send for ProofTree
impl Sync for ProofTree
impl Unpin for ProofTree
impl UnwindSafe for ProofTree
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more