Object/Class

at.logic.gapt.proofs.lkNew

ExistsLeftRule

Related Docs: class ExistsLeftRule | package lkNew

Permalink

object ExistsLeftRule extends RuleConvenienceObject with Serializable

Linear Supertypes
Serializable, Serializable, RuleConvenienceObject, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. ExistsLeftRule
  2. Serializable
  3. Serializable
  4. RuleConvenienceObject
  5. AnyRef
  6. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. def apply(subProof: LKProof, mainFormula: HOLFormula): ExistsLeftRule

    Permalink
  5. def apply(subProof: LKProof, mainFormula: HOLFormula, eigenVariable: Var): ExistsLeftRule

    Permalink
  6. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  7. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  8. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  9. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  10. def exception(text: String): LKRuleCreationException

    Permalink

    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.

    Definition Classes
    RuleConvenienceObject
  11. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  12. def findFormulasInPremise(premise: HOLSequent, antFormulas: Seq[HOLFormula], sucFormulas: Seq[HOLFormula]): (Seq[Int], Seq[Int])

    Permalink

    Method to determine the indices of formulas in a sequent.

    Method to determine the indices of formulas in a sequent.

    If either list contains duplicate formulas, they must occur that many times in the respective cedent.

    premise

    The sequent to find formulas in.

    antFormulas

    Formulas to be found in the antecedent.

    sucFormulas

    Formulas to be found in the succedent.

    Definition Classes
    RuleConvenienceObject
  13. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  14. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  15. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  16. val longName: String

    Permalink
    Definition Classes
    RuleConvenienceObject
  17. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  18. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  19. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  20. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  21. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  22. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from RuleConvenienceObject

Inherited from AnyRef

Inherited from Any

Ungrouped