An atom P(x1,..., xn) where P stands for a more complex formula.
The expression that P abbreviates. Must have the same type as P.
An expansion tree with shallowFormula definedExpr(x1,...,xn)
An expansion tree with shallowFormula definedExpr(x1,...,xn)
An expansion tree with shallowFormula definedExpr(x1,...,xn)
Operations that view the sub-proofs as a DAG, which ignore duplicate sub-proofs, see DagProof.DagLikeOps for a list.
Operations that view the sub-proofs as a DAG, which ignore duplicate sub-proofs, see DagProof.DagLikeOps for a list.
The expression that P abbreviates.
The expression that P abbreviates. Must have the same type as P.
Depth of the proof, which is the maximum length of a path you can take via immediateSubProofs.
Depth of the proof, which is the maximum length of a path you can take via immediateSubProofs.
The immediate subproofs of this rule.
The immediate subproofs of this rule.
The name of this rule (in words).
The name of this rule (in words).
The name of this rule (in symbols).
The name of this rule (in symbols).
An atom P(x1,..., xn) where P stands for a more complex formula.
An atom P(x1,..., xn) where P stands for a more complex formula.
Set of all (transitive) sub-proofs including this.
Set of all (transitive) sub-proofs including this.
Operations that view the sub-proofs as a tree, see DagProof.TreeLikeOps for a list.
Operations that view the sub-proofs as a tree, see DagProof.TreeLikeOps for a list.
Expansion tree node for definitions.
An atom P(x1,..., xn) where P stands for a more complex formula.
The expression that P abbreviates. Must have the same type as P.
An expansion tree with shallowFormula definedExpr(x1,...,xn)