Packages

object ExistsRightRule extends ConvenienceConstructor with Serializable

Source
lk.scala
Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ExistsRightRule
  2. Serializable
  3. Serializable
  4. ConvenienceConstructor
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. type IndexOrFormula = Either[SequentIndex, Formula]
    Definition Classes
    ConvenienceConstructor

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

    Create an LKRuleCreationException with a message starting with "Cannot create $longName: ..."

    Create an LKRuleCreationException with a message starting with "Cannot create $longName: ..."

    text

    The rest of the message.

    Attributes
    protected
    Definition Classes
    ConvenienceConstructor
  5. def apply(subProof: LKProof, aux: SequentIndex, mainFormula: Formula, term: Expr): ExistsRightRule
  6. def apply(subProof: LKProof, mainFormula: Formula): ExistsRightRule

    Convenience constructor for ∃:r that, given a main formula, will try to construct an inference with that formula.

    Convenience constructor for ∃:r that, given a main formula, will try to construct an inference with that formula.

    subProof

    The subproof.

    mainFormula

    The formula to be inferred. Must be of the form ∃x.A. The premise must contain A.

  7. def apply(subProof: LKProof, mainFormula: Formula, term: Expr): ExistsRightRule

    Convenience constructor for ∃:r that, given a main formula and a term, will try to construct an inference with that instantiation.

    Convenience constructor for ∃:r that, given a main formula and a term, will try to construct an inference with that instantiation.

    subProof

    The subproof.

    mainFormula

    The formula to be inferred. Must be of the form ∃x.A.

    term

    A term t such that A[t] occurs in the premise.

  8. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  9. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  11. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  12. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  13. def findAndValidate(premise: HOLSequent)(antIndicesFormulas: Seq[IndexOrFormula], sucIndicesFormulas: Seq[IndexOrFormula]): (Seq[Int], Seq[Int])

    Combines findIndicesOrFormulasInPremise and validateIndices.

    Combines findIndicesOrFormulasInPremise and validateIndices. That is, it will return a pair of lists of indices and throw an exception if either list contains a -1.

    premise

    The sequent in question.

    antIndicesFormulas

    The list of indices or formulas in the antecedent.

    sucIndicesFormulas

    The list of indices or formulas in the succedent.

    Attributes
    protected
    Definition Classes
    ConvenienceConstructor
  14. def findIndicesOrFormulasInPremise(premise: HOLSequent)(antIndicesFormulas: Seq[IndexOrFormula], sucIndicesFormulas: Seq[IndexOrFormula]): (Seq[Formula], Seq[Int], Seq[Formula], Seq[Int])
    Definition Classes
    ConvenienceConstructor
  15. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  16. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  17. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  18. val longName: String
    Definition Classes
    ConvenienceConstructor
  19. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  20. final def notify(): Unit
    Definition Classes
    AnyRef
  21. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  22. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  23. def toString(): String
    Definition Classes
    AnyRef → Any
  24. def validateIndices(premise: HOLSequent)(antFormulas: Seq[Formula], antIndices: Seq[Int], sucFormulas: Seq[Formula], sucIndices: Seq[Int]): Unit

    Throws an exception if the output of findFormulasInPremise contains any -1 entries.

    Throws an exception if the output of findFormulasInPremise contains any -1 entries.

    premise

    The sequent in question.

    antFormulas

    The list of formulas in the antecedent.

    antIndices

    The list of indices corresponding to antFormulas.

    sucFormulas

    The list of formulas in the succedent.

    sucIndices

    The list indices corresponding to sucFormulas.

    Attributes
    protected
    Definition Classes
    ConvenienceConstructor
  25. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  26. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  27. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from ConvenienceConstructor

Inherited from AnyRef

Inherited from Any

Ungrouped