Instances for the induction base.
Instances for the induction step.
Instances for the conclusion.
Terms used in the induction step.
Terms used in the conclusion
The formula induced over. This argument defaults to X(α, ν, γ) with X a second-order variable, i.e. an unknown induction formula.
Instances for the induction base.
Instances for the induction step.
Instances for the conclusion.
Returns true iff the induction formula needs to be quantified over.
The formula induced over.
The formula induced over. This argument defaults to X(α, ν, γ) with X a second-order variable, i.e. an unknown induction formula.
True if this is a schematic sip, i.e. the induction formula is unknown.
True if the induction formula is in fact a solution.
TODO: Find a better name for this
TODO: Find a better name for this
A FOLFormula
This with the induction formula replaced by f
Terms used in the induction step.
Computes the nth instance proof, with user-supplied proofs π0, π1, π2.
Computes the nth instance proof, with user-supplied proofs π0, π1, π2.
A natural number
Proof of the induction base.
Proof of the induction step.
Proof of the conclusion.
The nth instance of this sip.
Computes the nth instance proof,
Computes the nth instance proof,
A natural number
The prover used to generate π0 ,…,π2.
The nth instance of this sip.
Computes the nth instance proof.
Computes the nth instance proof. Uses prover9 to compute the subproofs.
A natural number
The nth instance of this sip.
Converts this into an LKProof, calling prover9 to provide π0, π1, π2.
Converts this into an LKProof, calling prover9 to provide π0, π1, π2.
The LKProof represented by this object
The prover used to generate π0 ,…,π2.
Converts this into an LKProof, with user-supplied proofs π0, π1, π2.
Converts this into an LKProof, with user-supplied proofs π0, π1, π2.
Proof of the induction base.
Proof of the induction step.
Proof of the conclusion.
The LKProof represented by this object.
Extracts a SIP grammar from the SIP according to the paper.
Extracts a SIP grammar from the SIP according to the paper.
The grammar corresponding to the sip.
Terms used in the conclusion
Models a simple induction proof.