o

gapt.proofs.lk.rules.macros

ContractionRightMacroRule

object ContractionRightMacroRule

This macro rule simulates a series of contractions in the succedent.

Source
ContractionRightMacroRule.scala
Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ContractionRightMacroRule
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

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 apply(p: LKProof, form: Formula, n: Int = 1): LKProof

    Contracts one formula in the succedent down to n occurrences.

    Contracts one formula in the succedent down to n occurrences. Use with care!

    p

    A proof.

    form

    A formula.

    n

    Maximum number of occurrences of form in the succedent of the end sequent. Defaults to 1, i.e. all occurrences are contracted.

  5. def apply(p: LKProof, occs: Seq[SequentIndex]): LKProof

    p

    A proof.

    occs

    A list of occurrences of a formula in the succedent of s1.

    returns

    A proof ending with as many contraction rules as necessary to contract occs into a single occurrence.

  6. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  7. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  8. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  9. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  10. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  11. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  12. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  13. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  14. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  15. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  16. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  17. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  18. def toString(): String
    Definition Classes
    AnyRef → Any
  19. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  20. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  21. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  22. def withSequentConnector(p: LKProof, form: Formula, n: Int = 1): (LKProof, SequentConnector)

    Contracts one formula in the succedent down to n occurrences.

    Contracts one formula in the succedent down to n occurrences. Use with care!

    p

    A proof.

    form

    A formula.

    n

    Maximum number of occurrences of form in the succedent of the end sequent. Defaults to 1, i.e. all occurrences are contracted.

    returns

    A proof and an SequentConnector connecting its end sequent with the end sequent of p.

  23. def withSequentConnector(p: LKProof, occs: Seq[SequentIndex]): (LKProof, SequentConnector)

    p

    A proof.

    occs

    A list of occurrences of a formula in the succedent of s1.

    returns

    A proof ending with as many contraction rules as necessary to contract occs into a single occurrence and an SequentConnector.

Inherited from AnyRef

Inherited from Any

Ungrouped