abstract class NDProof extends SequentProof[Formula, NDProof]
- Alphabetic
- By Inheritance
- NDProof
- SequentProof
- DagProof
- Product
- Equals
- AnyRef
- Any
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new NDProof()
Abstract Value Members
- abstract def auxIndices: Seq[Seq[SequentIndex]]
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
- SequentProof
- abstract def canEqual(that: Any): Boolean
- Definition Classes
- Equals
- abstract def conclusion: Sequent[Formula]
The conclusion of the rule.
The conclusion of the rule.
- Definition Classes
- SequentProof
- abstract def immediateSubProofs: Seq[NDProof]
The immediate subproofs of this rule.
The immediate subproofs of this rule.
- Definition Classes
- DagProof
- abstract def mainIndices: Seq[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
- SequentProof
- abstract def occConnectors: Seq[SequentConnector]
A list of occurrence connectors, one for each immediate subproof.
A list of occurrence connectors, one for each immediate subproof.
- Definition Classes
- SequentProof
- abstract def productArity: Int
- Definition Classes
- Product
- abstract def productElement(n: Int): Any
- Definition Classes
- Product
Concrete Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- def +(other: String): String
- def ->[B](y: B): (NDProof, B)
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def NDRuleCreationException(message: String): NDRuleCreationException
- Attributes
- protected
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- 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
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @IntrinsicCandidate()
- def dagLike: DagLikeOps[NDProof]
Operations that view the sub-proofs as a DAG, which ignore duplicate sub-proofs, see gapt.proofs.DagProof.DagLikeOps for a list.
Operations that view the sub-proofs as a DAG, which ignore duplicate sub-proofs, see gapt.proofs.DagProof.DagLikeOps for a list.
- Definition Classes
- DagProof
- 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
- final def endSequent: Sequent[Formula]
The end-sequent of the rule.
- def ensuring(cond: (NDProof) => Boolean, msg: => Any): NDProof
- def ensuring(cond: (NDProof) => Boolean): NDProof
- def ensuring(cond: Boolean, msg: => Any): NDProof
- def ensuring(cond: Boolean): NDProof
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(that: Any): Boolean
- Definition Classes
- DagProof → Equals → AnyRef → Any
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
- val hashCode: Int
- Definition Classes
- DagProof
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def longName: String
The name of this rule (in words).
The name of this rule (in words).
- Definition Classes
- DagProof
- def mainFormulas: Seq[Formula]
The list of main formulas of the rule.
The list of main formulas of the rule.
- Definition Classes
- SequentProof
- def name: String
The name of this rule (in symbols).
The name of this rule (in symbols).
- Definition Classes
- DagProof
- 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()
- def premises: Seq[Sequent[Formula]]
The upper sequents of the rule.
The upper sequents of the rule.
- Definition Classes
- SequentProof
- def productElementName(n: Int): String
- Definition Classes
- Product
- def productElementNames: Iterator[String]
- Definition Classes
- Product
- def productIterator: Iterator[Any]
- Definition Classes
- Product
- def productPrefix: String
- Definition Classes
- Product
- def stepString(subProofLabels: Map[Any, String]): String
- Attributes
- protected
- Definition Classes
- SequentProof → DagProof
- def subProofAt(pos: List[Int]): NDProof
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
- def subProofs: Set[NDProof]
Set of all (transitive) sub-proofs including this.
Set of all (transitive) sub-proofs including this.
- Definition Classes
- DagProof
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- final def target: Formula
The unique formula in the succedent of the end-sequent.
- def toString(): String
- Definition Classes
- DagProof → AnyRef → Any
- def treeLike: TreeLikeOps[NDProof]
Operations that view the sub-proofs as a tree, see gapt.proofs.DagProof.TreeLikeOps for a list.
Operations that view the sub-proofs as a tree, see gapt.proofs.DagProof.TreeLikeOps for a list.
- Definition Classes
- DagProof
- def validateIndices(premise: HOLSequent, antecedentIndices: 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.
- Attributes
- protected
- 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])
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
- def formatted(fmtstr: String): String
- Implicit
- This member is added by an implicit conversion from NDProof toStringFormat[NDProof] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.12.16) Use
formatString.format(value)instead ofvalue.formatted(formatString), or use thef""string interpolator. In Java 15 and later,formattedresolves to the new method in String which has reversed parameters.
- def →[B](y: B): (NDProof, B)
- Implicit
- This member is added by an implicit conversion from NDProof toArrowAssoc[NDProof] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use
->instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.
This is the API documentation for GAPT.
The main package is gapt.