c

at.logic.gapt.proofs.gaptic

OpenAssumption

case class OpenAssumption(labelledSequent: Sequent[(String, HOLFormula)], index: OpenAssumptionIndex = new OpenAssumptionIndex) extends InitialSequent with Product with Serializable

Defines the case class open assumption which considers an arbitrary labelled sequence an axiom.

Source
core.scala
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. OpenAssumption
  2. Serializable
  3. Serializable
  4. InitialSequent
  5. LKProof
  6. SequentProof
  7. DagProof
  8. Product
  9. Equals
  10. AnyRef
  11. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new OpenAssumption(labelledSequent: Sequent[(String, HOLFormula)], index: OpenAssumptionIndex = new OpenAssumptionIndex)

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from OpenAssumption to any2stringadd[OpenAssumption] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ->[B](y: B): (OpenAssumption, B)
    Implicit
    This member is added by an implicit conversion from OpenAssumption to ArrowAssoc[OpenAssumption] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  5. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  6. def LKRuleCreationException(message: String): LKRuleCreationException
    Definition Classes
    LKProof
  7. def apply(label: String): HOLFormula
  8. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  9. def auxFormulas: Seq[Seq[HOLFormula]]

    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
  10. 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
  11. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  12. def conclusion: Sequent[HOLFormula]

    The conclusion of the rule.

    The conclusion of the rule.

    Definition Classes
    OpenAssumptionSequentProof
  13. 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
  14. 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
  15. final def endSequent: Sequent[HOLFormula]

    The end-sequent of the rule.

    The end-sequent of the rule.

    Definition Classes
    LKProof
  16. def ensuring(cond: (OpenAssumption) ⇒ Boolean, msg: ⇒ Any): OpenAssumption
    Implicit
    This member is added by an implicit conversion from OpenAssumption to Ensuring[OpenAssumption] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  17. def ensuring(cond: (OpenAssumption) ⇒ Boolean): OpenAssumption
    Implicit
    This member is added by an implicit conversion from OpenAssumption to Ensuring[OpenAssumption] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  18. def ensuring(cond: Boolean, msg: ⇒ Any): OpenAssumption
    Implicit
    This member is added by an implicit conversion from OpenAssumption to Ensuring[OpenAssumption] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  19. def ensuring(cond: Boolean): OpenAssumption
    Implicit
    This member is added by an implicit conversion from OpenAssumption to Ensuring[OpenAssumption] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  20. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  21. def equals(that: Any): Boolean
    Definition Classes
    DagProof → Equals → AnyRef → Any
  22. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  23. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from OpenAssumption to StringFormat[OpenAssumption] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  24. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  25. val hashCode: Int
    Definition Classes
    DagProof
  26. def immediateSubProofs: Seq[Nothing]

    The immediate subproofs of this rule.

    The immediate subproofs of this rule.

    Definition Classes
    InitialSequentDagProof
  27. val index: OpenAssumptionIndex
  28. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  29. val labelledSequent: Sequent[(String, HOLFormula)]
  30. def labels: Sequent[String]
  31. def longName: String

    The name of this rule (in words).

    The name of this rule (in words).

    Definition Classes
    DagProof
  32. def mainFormulas: Seq[HOLFormula]

    The list of main formulas of the rule.

    The list of main formulas of the rule.

    Definition Classes
    SequentProof
  33. 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
  34. def name: String

    The name of this rule (in symbols).

    The name of this rule (in symbols).

    Definition Classes
    OpenAssumptionDagProof
  35. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  36. final def notify(): Unit
    Definition Classes
    AnyRef
  37. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  38. 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
  39. def premises: Seq[Sequent[HOLFormula]]

    The upper sequents of the rule.

    The upper sequents of the rule.

    Definition Classes
    SequentProof
  40. def stepString(subProofLabels: Map[Any, String]): String
    Attributes
    protected
    Definition Classes
    SequentProofDagProof
  41. 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
  42. def subProofs: Set[LKProof]

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

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

    Definition Classes
    DagProof
  43. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  44. def toPrettyString(implicit sig: BabelSignature): String
  45. def toString(): String
    Definition Classes
    DagProof → AnyRef → Any
  46. 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
  47. 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
  48. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  49. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  50. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  51. def [B](y: B): (OpenAssumption, B)
    Implicit
    This member is added by an implicit conversion from OpenAssumption to ArrowAssoc[OpenAssumption] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Inherited from Serializable

Inherited from Serializable

Inherited from InitialSequent

Inherited from LKProof

Inherited from SequentProof[HOLFormula, LKProof]

Inherited from DagProof[LKProof]

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd from OpenAssumption to any2stringadd[OpenAssumption]

Inherited by implicit conversion StringFormat from OpenAssumption to StringFormat[OpenAssumption]

Inherited by implicit conversion Ensuring from OpenAssumption to Ensuring[OpenAssumption]

Inherited by implicit conversion ArrowAssoc from OpenAssumption to ArrowAssoc[OpenAssumption]

Ungrouped