Object

at.logic.gapt.proofs.lk

WeakeningLeftMacroRule

Related Doc: package lk

Permalink

object WeakeningLeftMacroRule

This macro rule simulates a series of weakenings in the antecedent.

Source
macroRules.scala
Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. WeakeningLeftMacroRule
  2. AnyRef
  3. 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(p: LKProof, formula: HOLFormula, n: Int): LKProof

    Permalink

    p

    An LKProof.

    formula

    A Formula.

    n

    A natural number.

    returns

    p extended with weakenings such that formula occurs at least n times in the antecedent of the end sequent.

  5. def apply(p: LKProof, formulas: Seq[HOLFormula]): LKProof

    Permalink

    p

    A proof.

    formulas

    A list of formulas.

    returns

    A new proof whose antecedent contains new occurrences of the formulas in formulas.

  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 finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  11. final def getClass(): Class[_]

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

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

    Permalink
    Definition Classes
    Any
  14. final def ne(arg0: AnyRef): Boolean

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  22. def withOccConnector(p: LKProof, formula: HOLFormula, n: Int): (LKProof, OccConnector[HOLFormula])

    Permalink

    p

    An LKProof.

    formula

    A Formula.

    n

    A natural number.

    returns

    p extended with weakenings such that formula occurs at least n times in the antecedent of the end sequent and an OccConnector.

  23. def withOccConnector(p: LKProof, formulas: Seq[HOLFormula]): (LKProof, OccConnector[HOLFormula])

    Permalink

    p

    A proof.

    formulas

    A list of formulas.

    returns

    A new proof whose antecedent contains new occurrences of the formulas in formulas and an OccConnector.

Inherited from AnyRef

Inherited from Any

Ungrouped