Object

at.logic.gapt.proofs.lk

cleanStructuralRules

Related Doc: package lk

Permalink

object cleanStructuralRules

Source
cleanStructuralRules.scala
Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. cleanStructuralRules
  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(proof: LKProof, reductive: Boolean = true): LKProof

    Permalink

    "Cleans up" a proof by permuting weakenings downward as far as possible.

    "Cleans up" a proof by permuting weakenings downward as far as possible.

    proof

    The LKProof to be transformed.

    reductive

    Whether the algorithm is allowed to discard "unnecessary" subproofs. True by default.

    returns

    A proof of the same end sequent (up to a permutation) in which all weakenings are performed as late as possible.

  5. final def asInstanceOf[T0]: T0

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

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  9. def finalize(): Unit

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

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  21. def withOccConnector(proof: LKProof, reductive: Boolean = true): (LKProof, OccConnector[HOLFormula])

    Permalink

    "Cleans up" a proof by permuting weakenings downward as far as possible.

    "Cleans up" a proof by permuting weakenings downward as far as possible.

    proof

    The LKProof to be transformed.

    reductive

    Whether the algorithm is allowed to discard "unnecessary" subproofs. True by default.

    returns

    A proof of the same end sequent (up to a permutation) in which all weakenings are performed as late as possible; and an OccConnector relating the end sequents of the old and new proofs.

Inherited from AnyRef

Inherited from Any

Ungrouped