Packages

case class ForallSkRightRule(subProof: LKProof, aux: SequentIndex, mainFormula: Formula, skolemTerm: Expr, skolemDef: Expr) extends UnaryLKProof with SkolemQuantifierRule with Product with Serializable

An LKProof ending with a universal quantifier on the right:

          (π)
     Γ :- Δ, A[x\s(...)]
    ---------------∀:r
     Γ :- Δ, ∀x.A
This rule requires a Skolem function s(...)

subProof

The proof π.

aux

The index of A[x\α].

mainFormula

The main formula A[x\s(...)]

skolemTerm

The Skolem term s(...)

skolemDef

The Skolem definition, see gapt.expr.hol.SkolemFunctions

Source
lk.scala
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ForallSkRightRule
  2. Serializable
  3. Serializable
  4. SkolemQuantifierRule
  5. CommonRule
  6. ContextRule
  7. UnaryLKProof
  8. LKProof
  9. SequentProof
  10. DagProof
  11. Product
  12. Equals
  13. AnyRef
  14. 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 ForallSkRightRule(subProof: LKProof, aux: SequentIndex, mainFormula: Formula, skolemTerm: Expr, skolemDef: Expr)

    subProof

    The proof π.

    aux

    The index of A[x\α].

    mainFormula

    The main formula A[x\s(...)]

    skolemTerm

    The Skolem term s(...)

    skolemDef

    The Skolem definition, see gapt.expr.hol.SkolemFunctions

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 ForallSkRightRule to any2stringadd[ForallSkRightRule] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ->[B](y: B): (ForallSkRightRule, B)
    Implicit
    This member is added by an implicit conversion from ForallSkRightRule to ArrowAssoc[ForallSkRightRule] 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
    Attributes
    protected
    Definition Classes
    LKProof
  7. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  8. val aux: SequentIndex
  9. val auxFormula: Formula
    Definition Classes
    SkolemQuantifierRule
  10. 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
  11. 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
    ForallSkRightRuleSequentProof
  12. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate() @throws( ... )
  13. lazy val conclusion: Sequent[Formula]

    The conclusion of the rule.

    The conclusion of the rule.

    Definition Classes
    ContextRuleSequentProof
  14. val context: Sequent[Formula]
    Definition Classes
    SkolemQuantifierRule
  15. def contexts: Seq[Sequent[Formula]]
    Attributes
    protected
    Definition Classes
    ContextRule
  16. 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
  17. 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
  18. final def endSequent: Sequent[Formula]

    The end-sequent of the rule.

    The end-sequent of the rule.

    Definition Classes
    LKProof
  19. def ensuring(cond: (ForallSkRightRule) ⇒ Boolean, msg: ⇒ Any): ForallSkRightRule
    Implicit
    This member is added by an implicit conversion from ForallSkRightRule to Ensuring[ForallSkRightRule] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  20. def ensuring(cond: (ForallSkRightRule) ⇒ Boolean): ForallSkRightRule
    Implicit
    This member is added by an implicit conversion from ForallSkRightRule to Ensuring[ForallSkRightRule] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  21. def ensuring(cond: Boolean, msg: ⇒ Any): ForallSkRightRule
    Implicit
    This member is added by an implicit conversion from ForallSkRightRule to Ensuring[ForallSkRightRule] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  22. def ensuring(cond: Boolean): ForallSkRightRule
    Implicit
    This member is added by an implicit conversion from ForallSkRightRule to Ensuring[ForallSkRightRule] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  23. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  24. def equals(that: Any): Boolean
    Definition Classes
    DagProof → Equals → AnyRef → Any
  25. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from ForallSkRightRule to StringFormat[ForallSkRightRule] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  26. def formulasToBeDeleted: Seq[Seq[SequentIndex]]
    Attributes
    protected
    Definition Classes
    ContextRule
  27. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  28. def getSequentConnector: SequentConnector

    The object connecting the lower and upper sequents.auxFormulas

    The object connecting the lower and upper sequents.auxFormulas

    Definition Classes
    UnaryLKProof
  29. val hashCode: Int
    Definition Classes
    DagProof
  30. def immediateSubProofs: Seq[LKProof]

    The immediate subproofs of this rule.

    The immediate subproofs of this rule.

    Definition Classes
    UnaryLKProofDagProof
  31. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  32. def longName: String

    The name of this rule (in words).

    The name of this rule (in words).

    Definition Classes
    DagProof
  33. val mainFormula: Formula
  34. def mainFormulaSequent: Sequent[Formula]
    Definition Classes
    ForallSkRightRuleContextRule
  35. def mainFormulas: Seq[Formula]

    The list of main formulas of the rule.

    The list of main formulas of the rule.

    Definition Classes
    SequentProof
  36. 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
    ContextRuleSequentProof
  37. def name: String

    The name of this rule (in symbols).

    The name of this rule (in symbols).

    Definition Classes
    ForallSkRightRuleDagProof
  38. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  39. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  40. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  41. 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
    ContextRuleSequentProof
  42. def premise: Sequent[Formula]

    The upper sequent of the rule.

    The upper sequent of the rule.

    Definition Classes
    UnaryLKProof
  43. def premises: Seq[Sequent[Formula]]

    The upper sequents of the rule.

    The upper sequents of the rule.

    Definition Classes
    SequentProof
  44. val quantifiedVariable: Var
  45. val skolemArgs: List[Expr]
    Definition Classes
    SkolemQuantifierRule
  46. val skolemConst: Const
    Definition Classes
    SkolemQuantifierRule
  47. val skolemDef: Expr
  48. val skolemTerm: Expr
  49. def stepString(subProofLabels: Map[Any, String]): String
    Attributes
    protected
    Definition Classes
    SequentProofDagProof
  50. val subFormula: Formula
  51. val subProof: LKProof

    The immediate subproof of the rule.

    The immediate subproof of the rule.

    Definition Classes
    ForallSkRightRuleUnaryLKProof
  52. 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
  53. def subProofs: Set[LKProof]

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

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

    Definition Classes
    DagProof
  54. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  55. def toString(): String
    Definition Classes
    DagProof → AnyRef → Any
  56. 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
  57. 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
  58. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  59. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  60. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  61. def [B](y: B): (ForallSkRightRule, B)
    Implicit
    This member is added by an implicit conversion from ForallSkRightRule to ArrowAssoc[ForallSkRightRule] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @Deprecated @deprecated @throws( classOf[java.lang.Throwable] )
    Deprecated

    (Since version ) see corresponding Javadoc for more information.

Inherited from Serializable

Inherited from Serializable

Inherited from SkolemQuantifierRule

Inherited from CommonRule

Inherited from ContextRule[Formula, LKProof]

Inherited from UnaryLKProof

Inherited from LKProof

Inherited from SequentProof[Formula, LKProof]

Inherited from DagProof[LKProof]

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

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

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

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

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

Ungrouped