object UniformAssociativity3ExampleProof extends ProofSequence
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- UniformAssociativity3ExampleProof
- ProofSequence
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- val Ax1: FOLFormula
- val Cs: FOLFormula
- val Symm: FOLFormula
- val Trans: FOLFormula
- def addAllAxioms(proof: LKProof): LKProof
- def apply(n: Int): LKProof
- Definition Classes
- UniformAssociativity3ExampleProof → ProofSequence
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def ax2_ax(x: FOLTerm, y: FOLTerm): FOLFormula
- def ax2_ax(x: FOLTerm): FOLFormula
- def ax2_ax(): FOLFormula
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @IntrinsicCandidate()
- val cp: AllQuantifiedConditionalAxiomHelper
- def cs_ax(x: FOLTerm, y: FOLTerm): FOLFormula
- def cs_ax(x: FOLTerm): FOLFormula
- def cs_ax(): FOLFormula
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def f1(sym: String, arg: FOLTerm): FOLTerm
- def f2(arg1: FOLTerm, sym: String, arg2: FOLTerm): FOLTerm
- def f2(sym: String, arg1: FOLTerm, arg2: FOLTerm): FOLTerm
- def gen_proof_step(i: Int, n: Int): LKProof
* Returns proof Pi (currently including line above and below Pi), with numerals n, i, i+1: (n + n) + i+1 = n + (n + i+1), Ax |- ...
* Returns proof Pi (currently including line above and below Pi), with numerals n, i, i+1: (n + n) + i+1 = n + (n + i+1), Ax |- ... Pi (n + n) + i = n + (n + i), Ax |- ...
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
- def induction_start(n: Int, p0: LKProof): LKProof
Close off proof ending in (n + n) + 0 = n + (n + 0) |- ...
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def name: String
- Definition Classes
- ProofSequence
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
- val p: String
- def refl_ax(x: FOLTerm, y: FOLTerm): FOLFormula
- def refl_ax(x: FOLTerm): FOLFormula
- def refl_ax(): FOLFormula
- def reflect(x: FOLTerm, y: FOLTerm, p: LKProof): LKProof
Takes a proof s2 with end-sequent of the form (x=y), ...
Takes a proof s2 with end-sequent of the form (x=y), ... |- ... and return one with end-sequent of the form (y=x), ... |- ...
- val s: String
- def show_by_ax2(x: FOLTerm, y: FOLTerm, p: LKProof): LKProof
- def show_by_cs(x: FOLTerm, y: FOLTerm, p: LKProof): LKProof
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- val x: FOLVar
- val x1: FOLVar
- val x2: FOLVar
- val y: FOLVar
- val y1: FOLVar
- val y2: FOLVar
- val z: FOLVar
This is the API documentation for GAPT.
The main package is gapt.