OrRightRule

Instance Constructors

new OrRightRule(subProof: LKProof, aux1: SequentIndex, aux2: SequentIndex)

subProof
The subproof π.
aux1
The index of A.
aux2
The index of B.

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
def LKRuleCreationException(message: String): LKRuleCreationException

Definition Classes
LKProof
final def asInstanceOf[T0]: T0

Definition Classes
Any
val aux1: SequentIndex

The index of A.
val aux2: SequentIndex

The index of B.
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
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
OrRightRule → SequentProof
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
lazy val conclusion: Sequent[HOLFormula]

The conclusion of the rule.
The conclusion of the rule.

Definition Classes
ContextRule → SequentProof
def contexts: Seq[Sequent[HOLFormula]]

Attributes
protected
Definition Classes
ContextRule
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
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[HOLFormula]

The end-sequent of the rule.
The end-sequent of the rule.

Definition Classes
LKProof
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(that: Any): Boolean

Definition Classes
DagProof → Equals → AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def formulasToBeDeleted: Seq[Seq[SequentIndex]]

Attributes
protected
Definition Classes
ContextRule
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def getOccConnector: OccConnector[HOLFormula]

The object connecting the lower and upper sequents.auxFormulas
The object connecting the lower and upper sequents.auxFormulas

Definition Classes
UnaryLKProof
val hashCode: Int

Definition Classes
DagProof → AnyRef → Any
def immediateSubProofs: Seq[LKProof]

The immediate subproofs of this rule.
The immediate subproofs of this rule.

Definition Classes
UnaryLKProof → DagProof
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
val leftDisjunct: HOLFormula
def longName: String

The name of this rule (in words).
The name of this rule (in words).

Definition Classes
DagProof
val mainFormula: HOLFormula
def mainFormulaSequent: Sequent[HOLFormula]

Definition Classes
OrRightRule → ContextRule
def mainFormulas: Seq[HOLFormula]

The list of main formulas of the rule.
The list of main formulas of the rule.

Definition Classes
SequentProof
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
ContextRule → SequentProof
def name: String

The name of this rule (in symbols).
The name of this rule (in symbols).

Definition Classes
OrRightRule → DagProof
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def occConnectors: Seq[OccConnector[HOLFormula]]

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

Definition Classes
ContextRule → SequentProof
def premise: Sequent[HOLFormula]

The upper sequent of the rule.
The upper sequent of the rule.

Definition Classes
UnaryLKProof
def premises: Seq[Sequent[HOLFormula]]

The upper sequents of the rule.
The upper sequents of the rule.

Definition Classes
SequentProof
val rightDisjunct: HOLFormula
def stepString(subProofLabels: Map[Any, String]): String

Attributes
protected
Definition Classes
SequentProof → DagProof
val subProof: LKProof

The subproof π.
The subproof π.

Definition Classes
OrRightRule → UnaryLKProof
def subProofs: Set[LKProof]

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
def toString(): String

Definition Classes
DagProof → AnyRef → Any
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
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
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Docs: object OrRightRule | package lk

case class OrRightRule(subProof: LKProof, aux1: SequentIndex, aux2: SequentIndex) extends UnaryLKProof with CommonRule with Product with Serializable

Instance Constructors

new OrRightRule(subProof: LKProof, aux1: SequentIndex, aux2: SequentIndex)

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def LKRuleCreationException(message: String): LKRuleCreationException

final def asInstanceOf[T0]: T0

val aux1: SequentIndex

val aux2: SequentIndex

def auxFormulas: Seq[Seq[HOLFormula]]

def auxIndices: Seq[Seq[SequentIndex]]

def clone(): AnyRef

lazy val conclusion: Sequent[HOLFormula]

def contexts: Seq[Sequent[HOLFormula]]

def dagLike: DagLikeOps[LKProof]

def depth: Int

final def endSequent: Sequent[HOLFormula]

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def finalize(): Unit

def formulasToBeDeleted: Seq[Seq[SequentIndex]]

final def getClass(): Class[_]

def getOccConnector: OccConnector[HOLFormula]

val hashCode: Int

def immediateSubProofs: Seq[LKProof]

final def isInstanceOf[T0]: Boolean

val leftDisjunct: HOLFormula

def longName: String

val mainFormula: HOLFormula

def mainFormulaSequent: Sequent[HOLFormula]

def mainFormulas: Seq[HOLFormula]

def mainIndices: Seq[SequentIndex]

def name: String

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def occConnectors: Seq[OccConnector[HOLFormula]]

def premise: Sequent[HOLFormula]

def premises: Seq[Sequent[HOLFormula]]

val rightDisjunct: HOLFormula

def stepString(subProofLabels: Map[Any, String]): String

val subProof: LKProof

def subProofs: Set[LKProof]

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

def treeLike: TreeLikeOps[LKProof]

def validateIndices(premise: HOLSequent, antecedentIndices: Seq[SequentIndex], succedentIndices: Seq[SequentIndex]): Unit

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from Serializable

Inherited from Serializable

Inherited from CommonRule

Inherited from ContextRule[HOLFormula, LKProof]

Inherited from UnaryLKProof

Inherited from LKProof

Inherited from SequentProof[HOLFormula, LKProof]

Inherited from DagProof[LKProof]

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped