Packages

o

at.logic.gapt.proofs.lk

TopAxiom

object TopAxiom extends InitialSequent with Product with Serializable

An LKProof introducing ⊤ on the right:

      --------⊤:r
        :- ⊤

Source
lk.scala
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. TopAxiom
  2. Serializable
  3. Serializable
  4. InitialSequent
  5. LKProof
  6. SequentProof
  7. DagProof
  8. Product
  9. Equals
  10. AnyRef
  11. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def LKRuleCreationException(message: String): LKRuleCreationException
    Definition Classes
    LKProof
  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def auxFormulas: Seq[Seq[Formula]]

    A list of lists containing the auxiliary formulas of the rule.

    A list of lists containing the auxiliary formulas of the rule. The first list constains the auxiliary formulas in the first premise and so on.

    Definition Classes
    SequentProof
  7. def auxIndices: Seq[Nothing]

    A list of lists of SequentIndices denoting the auxiliary formula(s) of the rule.

    A list of lists of SequentIndices denoting the auxiliary formula(s) of the rule. The first list contains the auxiliary formulas in the first premise and so on.

    Definition Classes
    InitialSequentSequentProof
  8. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  9. def conclusion: Sequent[PropFormula with Const]

    The conclusion of the rule.

    The conclusion of the rule.

    Definition Classes
    TopAxiomSequentProof
  10. def dagLike: DagLikeOps[LKProof]

    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.

    Definition Classes
    DagProof
  11. def depth: Int

    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.

    Definition Classes
    DagProof
  12. final def endSequent: Sequent[Formula]

    The end-sequent of the rule.

    The end-sequent of the rule.

    Definition Classes
    LKProof
  13. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  14. def equals(that: Any): Boolean
    Definition Classes
    DagProof → Equals → AnyRef → Any
  15. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  16. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  17. val hashCode: Int
    Definition Classes
    DagProof
  18. def immediateSubProofs: Seq[Nothing]

    The immediate subproofs of this rule.

    The immediate subproofs of this rule.

    Definition Classes
    InitialSequentDagProof
  19. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  20. def longName: String

    The name of this rule (in words).

    The name of this rule (in words).

    Definition Classes
    DagProof
  21. def mainFormula: PropFormula with Const
  22. def mainFormulas: Seq[Formula]

    The list of main formulas of the rule.

    The list of main formulas of the rule.

    Definition Classes
    SequentProof
  23. def mainIndices: Vector[SequentIndex]

    A list of SequentIndices denoting the main formula(s) of the rule.

    A list of SequentIndices denoting the main formula(s) of the rule.

    Definition Classes
    InitialSequentSequentProof
  24. def name: String

    The name of this rule (in symbols).

    The name of this rule (in symbols).

    Definition Classes
    TopAxiomDagProof
  25. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  26. final def notify(): Unit
    Definition Classes
    AnyRef
  27. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  28. def occConnectors: Seq[Nothing]

    A list of occurrence connectors, one for each immediate subproof.

    A list of occurrence connectors, one for each immediate subproof.

    Definition Classes
    InitialSequentSequentProof
  29. def premises: Seq[Sequent[Formula]]

    The upper sequents of the rule.

    The upper sequents of the rule.

    Definition Classes
    SequentProof
  30. def stepString(subProofLabels: Map[Any, String]): String
    Attributes
    protected
    Definition Classes
    SequentProofDagProof
  31. def subProofAt(pos: List[Int]): LKProof

    Returns the subproof at the given position: p.subProofAt(Nil) is p itself; p.subProofAt(i :: is) is the ith subproof of p.subProofAt(is).

    Returns the subproof at the given position: p.subProofAt(Nil) is p itself; p.subProofAt(i :: is) is the ith subproof of p.subProofAt(is).

    Definition Classes
    DagProof
  32. def subProofs: Set[LKProof]

    Set of all (transitive) sub-proofs including this.

    Set of all (transitive) sub-proofs including this.

    Definition Classes
    DagProof
  33. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  34. def toString(): String
    Definition Classes
    DagProof → AnyRef → Any
  35. def treeLike: TreeLikeOps[LKProof]

    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.

    Definition Classes
    DagProof
  36. def validateIndices(premise: HOLSequent, antecedentIndices: Seq[SequentIndex], succedentIndices: Seq[SequentIndex]): Unit

    Checks whether indices are in the right place and premise is defined at all of them.

    Checks whether indices are in the right place and premise is defined at all of them.

    premise

    The sequent to be checked.

    antecedentIndices

    Indices that should be in the antecedent.

    succedentIndices

    Indices that should be in the succedent.

    Attributes
    protected
    Definition Classes
    LKProof
  37. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  38. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  39. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from InitialSequent

Inherited from LKProof

Inherited from SequentProof[Formula, LKProof]

Inherited from DagProof[LKProof]

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped