Package

at.logic.gapt

examples

Permalink

package examples

Source
package.scala
Linear Supertypes
Content Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. examples
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. class AllQuantifiedConditionalAxiomHelper extends AnyRef

    Permalink

    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 |- ...

  2. trait ExplicitEqualityTactics extends AnyRef

    Permalink
  3. trait ProofSequence extends AnyRef

    Permalink
  4. class Script extends App

    Permalink
  5. abstract class nTape extends AnyRef

    Permalink

    The generic template for the nTape proofs.

  6. class nTape4 extends nTape

    Permalink

    Version 3 of the higher-order n-Tape proof.

  7. class nTape5 extends nTape4

    Permalink

    Version 5 of the higher-order n-Tape proof, where if-then-else is directly axiomatized i.e.

    Version 5 of the higher-order n-Tape proof, where if-then-else is directly axiomatized i.e. it has 2 additional axioms P -> if code(P) then t else f = t and -P -> if code(P) then t else f = f which were theorems before. In contrast to nTape4 it cuts on instances of the theorem C for specific upper bounds n. Since the instantiated proofs were generated manually, only nTape5(2) to nTape5(4) work.

  8. class nTape5Arith extends nTape4

    Permalink

    Version 5 of the higher-order n-Tape proof, where if-then-else is still proved in arithmetic.

    Version 5 of the higher-order n-Tape proof, where if-then-else is still proved in arithmetic. In contrast to nTape4 it cuts on instances of the theorem C for specific upper bounds n. Since the instantiated proofs were generated manually, only nTape5Arith(2) works.

Value Members

  1. object BussTautology

    Permalink

    Creates the n-th tautology of a sequence that has only exponential-size cut-free proofs

    Creates the n-th tautology of a sequence that has only exponential-size cut-free proofs

    This sequence is taken from: S. Buss. "Weak Formal Systems and Connections to Computational Complexity". Lecture Notes for a Topics Course, UC Berkeley, 1988, available from: http://www.math.ucsd.edu/~sbuss/ResearchWeb/index.html

  2. object FactorialFunctionEqualityExampleProof extends ProofSequence

    Permalink

    Proof of f(n) = g(n, 1), where f is the head recursive and g the tail recursive formulation of the factorial function

  3. object FactorialFunctionEqualityExampleProof2 extends ProofSequence

    Permalink
  4. object Formulas

    Permalink

    Contains some commonly used formulas.

  5. object LinearEqExampleProof extends TacticsProof with ProofSequence with ExplicitEqualityTactics

    Permalink

    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.

  6. object LinearExampleProof extends ProofSequence

    Permalink

    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.

  7. object PQPairs

    Permalink

    Creates the n-th formula of a sequence where distributivity-based algorithm produces only exponential CNFs.

  8. object Permutations

    Permalink

    Given n >= 2 creates an unsatisfiable first-order clause set based on a statement about the permutations in S_n.

  9. object Pi2Pigeonhole

    Permalink
  10. object PigeonHolePrinciple

    Permalink

    Constructs a formula representing the pigeon hole principle.

    Constructs a formula representing the pigeon hole principle. More precisely: PigeonHolePrinciple( p, h ) states that if p pigeons are put into h holes then there is a hole which contains two pigeons. PigeonHolePrinciple( p, h ) is a tautology iff p > h.

    Since we want to avoid empty disjunctions, we assume > 1 pigeons.

  11. object ReductionDemo extends Script

    Permalink
  12. object ReforestDemo extends Script

    Permalink
  13. object SquareDiagonalExampleProof extends ProofSequence

    Permalink

    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.

  14. object SquareEdges2DimExampleProof extends ProofSequence

    Permalink

    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.

  15. object SquareEdgesExampleProof extends ProofSequence

    Permalink

    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

  16. object SumExampleProof extends ProofSequence

    Permalink

    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.

  17. object SumOfOnesExampleProof extends ProofSequence

    Permalink

    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.

  18. object SumOfOnesF2ExampleProof extends TacticsProof with ProofSequence with ExplicitEqualityTactics

    Permalink
  19. object SumOfOnesFExampleProof extends TacticsProof with ProofSequence with ExplicitEqualityTactics

    Permalink
  20. object UniformAssociativity3ExampleProof extends ProofSequence

    Permalink
  21. object complex

    Permalink
  22. object drinker

    Permalink
  23. object epsilon extends Script

    Permalink
  24. object equation_example

    Permalink
  25. object fol1 extends TacticsProof

    Permalink
  26. package hoare

    Permalink
  27. package induction

    Permalink
  28. object inductionExamples extends Script

    Permalink
  29. object instprover extends Script

    Permalink
  30. object lattice extends TacticsProof

    Permalink
  31. object lkTests

    Permalink
  32. object meta

    Permalink
  33. object nTape2 extends nTape

    Permalink

    Version 2 of the higher-order n-Tape proof.

  34. object nTape3 extends nTape

    Permalink

    Version 3 of the higher-order n-Tape proof.

  35. object nTape4

    Permalink
  36. object nTape5

    Permalink

    Version 5 of the higher-order n-Tape proof.

    Version 5 of the higher-order n-Tape proof. In contrast to nTape4 it cuts on instances of the theorem C for specific upper bounds n. Since the instantiated proofs were generated manually, only nTape5(2) to nTape5(4) work.

  37. object nTape5Arith

    Permalink

    Version 5 of the higher-order n-Tape proof, where if-then-else is still proved in arithmetic.

    Version 5 of the higher-order n-Tape proof, where if-then-else is still proved in arithmetic. In contrast to nTape4 it cuts on instances of the theorem C for specific upper bounds n. Since the instantiated proofs were generated manually, only nTape5Arith(2) works.

  38. object nTape6

    Permalink

    The object nTape6 generates hard problems for higher order theorem provers containing an axiomatization of if-then-else.

    The object nTape6 generates hard problems for higher order theorem provers containing an axiomatization of if-then-else. Formulas: f1,f2 ... if-then-else axiomatizations f3,f4 ... properties of the successor function (0 is no successor and a number is always different from its successor) conclusion0 ... there exists a function h s.t. h(0) = 1, h(1) = 0 conclusion1 ... there exists a function h s.t. h(0) = 1, h(1) = 0, h(2) = 0 conclusion2 ... there exists a function h s.t. h(0) = 1, h(1) = 0, h(2) = 1 w1 ... witness for sc w2 ... witness for sc2

    The problems are (in sequent notation):

    P0: f1, f2 :- conclusion0 P1: f1, f2, f3, f4 :- conclusion1 P2: f1, f2, f3, f4 :- conclusion2

    The generated filenames are "ntape6-${i}-without-witness.tptp" for i = 0 to 2.

    To show that there are actual witnesses for the function h, we provide a witness, where the witness w1 can be used for both W0 and W1:

    W0: { w1 :- } x P0 W1: { w1 :- } x P1 W2: { w2 :- } x P2

    The generated filenames are "ntape6-${i}-with-witness.tptp" for i = 0 to 2.

  39. object philsci

    Permalink
  40. package poset

    Permalink
  41. package prime

    Permalink
  42. object primediv extends TacticsProof

    Permalink
  43. val proofSequences: Seq[ProofSequence]

    Permalink
  44. object propositional

    Permalink
  45. package recschem

    Permalink
  46. object tape extends TacticsProof

    Permalink
  47. object tapeUrban extends TacticsProof

    Permalink

    Formalisation of the tape-proof as described in C.

    Formalisation of the tape-proof as described in C. Urban: Classical Logic and Computation, PhD Thesis, Cambridge University, 2000.

  48. object tbillc

    Permalink

    This is an example used in the talk[1] at TbiLLC 2013.

    This is an example used in the talk[1] at TbiLLC 2013. It generates a (cut-free) LK proof where the extracted expansion tree has nested quantifiers.

    [1] http://www.illc.uva.nl/Tbilisi/Tbilisi2013/uploaded_files/inlineitem/riener.pdf

Inherited from AnyRef

Inherited from Any

Ungrouped