package sequence
- Alphabetic
- Public
- Protected
Type Members
- class AllQuantifiedConditionalAxiomHelper extends AnyRef
Auxiliary structure to deal with axioms of the schema: Forall variables cond1 -> cond2 -> ...
Auxiliary structure to deal with axioms of the schema: Forall variables cond1 -> cond2 -> ... -> condn -> consequence |- ...
- trait ExplicitEqualityTactics extends AnyRef
- trait ProofSequence extends AnyRef
Value Members
- object FactorialFunctionEqualityExampleProof extends ProofSequence
Proof of f(n) = g(n, 1), where f is the head recursive and g the tail recursive formulation of the factorial function
- object FactorialFunctionEqualityExampleProof2 extends ProofSequence
- object LinearCutExampleProof extends ProofSequence
Constructs short FOL LK proofs of the sequents
Constructs short FOL LK proofs of the sequents
P(0), ∀x. P(x) → P(s(x)) :- P(s2 n (0))
where n is an Integer parameter >= 0.
- object LinearEqExampleProof extends TacticsProof with ProofSequence with ExplicitEqualityTactics
Functions to construct cut-free FOL LK proofs of the sequents
Functions to construct cut-free FOL LK proofs of the sequents
Refl, Trans, \ALL x. f(x) = x :- fn(a) = a
where n is an Integer parameter >= 0.
- object LinearExampleProof extends ProofSequence
Constructs cut-free FOL LK proofs of the sequents
Constructs cut-free FOL LK proofs of the sequents
P(0), ∀x. P(x) → P(s(x)) :- P(sn(0))
where n is an Integer parameter >= 0.
- object LinearRightCutExampleProof extends ProofSequence
- object SquareDiagonalExampleProof extends ProofSequence
Functions to construct cut-free FOL LK proofs of the sequents
Functions to construct cut-free FOL LK proofs of the sequents
P(0,0), ∀x,y. P(x,y) → P(s(x),y), ∀x,y. P(x,y) → P(x,s(y)) :- P(sn(0),sn(0))
where n is an Integer parameter >= 0.
The proofs constructed here go along the diagonal of P, i.e. one x-step, then one y-step, etc.
- object SquareEdges2DimExampleProof extends ProofSequence
Functions to construct cut-free FOL LK proofs of the sequents
Functions to construct cut-free FOL LK proofs of the sequents
P(a,b), ∀x,y. P(x,y) → P(sx(x),y), ∀x,y. P(x,y) → P(x,sy(y)) :- P(sxn(a),syn(b))
where n is an Integer parameter >= 0.
The proofs constructed here go along the edges of P, i.e. first all X-steps are performed, then all Y-steps are performed, but unlike SquareEdgesExampleProof, different functions are used for the X- and the Y-directions.
- object SquareEdgesExampleProof extends ProofSequence
Functions to construct cut-free FOL LK proofs of the sequents
Functions to construct cut-free FOL LK proofs of the sequents
P(0,0), ∀x,y. P(x,y) → P(s(x),y), ∀x,y. P(x,y) → P(x,s(y)) :- P(sn(0),sn(0))
where n is an Integer parameter >= 0.
The proofs constructed here go along the edges of P, i.e. first all X-steps are performed, then all Y-steps are performed
- object SumExampleProof extends ProofSequence
Functions to construct the straightforward cut-free FOL LK proofs of the sequents
Functions to construct the straightforward cut-free FOL LK proofs of the sequents
P(sn(0),0), ∀x,y. P(s(x),y) → P(x,s(y)) :- P(0,sn(0))
where n is an Integer parameter >= 0.
This sequent is shown to have no cut-free proof which can be compressed by a single cut with a single quantifier in S. Eberhard, S. Hetzl: On the compressibility of finite languages and formal proofs, submitted, 2015.
- object SumOfOnesExampleProof extends ProofSequence
Functions to construct cut-free FOL LK proofs of the sequents
Functions to construct cut-free FOL LK proofs of the sequents
Refl, Trans, CongSuc, ABase, ASuc :- sum( n ) = sn(0)
where n is an Integer parameter >= 0.
- object SumOfOnesF2ExampleProof extends TacticsProof with ProofSequence with ExplicitEqualityTactics
- object SumOfOnesFExampleProof extends TacticsProof with ProofSequence with ExplicitEqualityTactics
- object UniformAssociativity3ExampleProof extends ProofSequence
This is the API documentation for GAPT.
The main package is gapt.