Packages

o

at.logic.gapt.proofs.lk

ForallRightBlock

object ForallRightBlock

Source
macroRules.scala
Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ForallRightBlock
  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(subProof: LKProof, main: Formula, eigenvariables: Seq[Var]): LKProof

    Applies the ForallRight-rule n times.

    Applies the ForallRight-rule n times. This method expects a formula main with a quantifier block, and a proof s1 which has a fully instantiated version of main on the right side of its bottommost sequent.

    The rule: 

                 (π)
   Γ :- Δ, A[x1\y1,...,xN\yN]
---------------------------------- (∀_r x n)
    Γ :- Δ, ∀x1,..,xN.A

where y1,...,yN are eigenvariables.

    subProof

    The proof π with (Γ :- Δ, A[x1\y1,...,xN\yN]) as the bottommost sequent.

    main

    A formula of the form (∀ x1,...,xN.A).

    eigenvariables

    The list of eigenvariables with which to instantiate main. The caller of this method has to ensure the correctness of these terms, and, specifically, that A[x1\y1,...,xN\yN] indeed occurs at the bottom of the proof π.

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

    Applies the ForallRight-rule n times.

    Applies the ForallRight-rule n times. This method expects a formula main with a quantifier block, and a proof s1 which has a fully instantiated version of main on the right side of its bottommost sequent.

    The rule: 

                 (π)
   Γ :- Δ, A[x1\y1,...,xN\yN]
---------------------------------- (∀_r x n)
    Γ :- Δ, ∀x1,..,xN.A

where y1,...,yN are eigenvariables.

    subProof

    The proof π with (Γ :- Δ, A[x1\y1,...,xN\yN]) as the bottommost sequent.

    main

    A formula of the form (∀ x1,...,xN.A).

    eigenvariables

    The list of eigenvariables with which to instantiate main. The caller of this method has to ensure the correctness of these terms, and, specifically, that A[x1\y1,...,xN\yN] indeed occurs at the bottom of the proof π.

    returns

    A pair consisting of an LKProof and an SequentConnector.

Inherited from AnyRef

Inherited from Any

Ungrouped