Object

at.logic.gapt.proofs.lkOld

AndRightRule

Related Doc: package lkOld

Permalink

object AndRightRule

Source
propositionalRules.scala
Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. AndRightRule
  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(s1: LKProof, s2: LKProof, term1: HOLFormula, term2: HOLFormula): base.BinaryLKProof with base.BinaryLKProof with AuxiliaryFormulas with PrincipalFormulas

    Permalink

    Merges two formulas term1 & term2 into a conjunction A And B.
    If term1 and/or term2 occur more than once each, only one occurrence
    of each is merged.
    
    Let s1 have (sL |- sR, term1) as its bottommost sequent and
    let s2 have (tL |- tR, term2) as its bottommost sequent.
    
    The rule:
    (rest of s1)             (rest of s2)
    sL |- sR, term1        tL |- tR, term2
    -------------------------------------- (AndRight)
       sL, tL |- sR, tR, term1 ∧ term2
    

    Merges two formulas term1 & term2 into a conjunction A And B.
    If term1 and/or term2 occur more than once each, only one occurrence
    of each is merged.
    
    Let s1 have (sL |- sR, term1) as its bottommost sequent and
    let s2 have (tL |- tR, term2) as its bottommost sequent.
    
    The rule:
    (rest of s1)             (rest of s2)
    sL |- sR, term1        tL |- tR, term2
    -------------------------------------- (AndRight)
       sL, tL |- sR, tR, term1 ∧ term2
    

    s1

    The left proof with A in the succedent of its bottommost sequent.

    s2

    The right proof with B in the succedent of its bottommost sequent.

    term1

    The left part of the conjunction in s1.

    term2

    The right part of the conjunction in s2.

    returns

    An LK proof with s1 & s2 as its two subtrees and (sL, tL |- sR, tR, term1 ∧ term2) as its bottommost sequent.

  5. def apply(s1: OccSequent, s2: OccSequent, term1oc: FormulaOccurrence, term2oc: FormulaOccurrence): Sequent[FormulaOccurrence]

    Permalink

    Merges two formulas A & B (marked by term1oc & term2oc in the
    succedents of s1 & s2) into a conjunction A And B.
    This function merely returns the resulting sequent, not a proof.
    
    Let s1 be the sequent (sL |- sR, A).
    let s2 be the sequent (tL |- tR, B).
    The function returns (sL, tL |- sR, tR, A ∧ B).
    

    Merges two formulas A & B (marked by term1oc & term2oc in the
    succedents of s1 & s2) into a conjunction A And B.
    This function merely returns the resulting sequent, not a proof.
    
    Let s1 be the sequent (sL |- sR, A).
    let s2 be the sequent (tL |- tR, B).
    The function returns (sL, tL |- sR, tR, A ∧ B).
    

    s1

    The left sequent.

    s2

    The right sequent.

    term1oc

    The occurrence of A in s1.

    term2oc

    The occurrence of B in s2.

    returns

    The sequent (sL, tL |- sR, tR, A ∧ B).

  6. def apply(s1: LKProof, s2: LKProof, term1oc: FormulaOccurrence, term2oc: FormulaOccurrence): BinaryTree[OccSequent] with base.BinaryLKProof with AuxiliaryFormulas with PrincipalFormulas { def rule: at.logic.gapt.proofs.lkOld.AndRightRuleType.type }

    Permalink

    Merges two formulas A & B (marked by term1oc & term2oc in the
    succedents of s1 & s2) into a conjunction A And B.
    
    Let s1 have (sL |- sR, A) as its bottommost sequent and
    let s2 have (tL |- tR, B) as its bottommost sequent.
    
    The rule:
    (rest of s1)       (rest of s2)
    sL |- sR, A        tL |- tR, B
    ------------------------------ (AndRight)
       sL, tL |- sR, tR, A ∧ B
    

    Merges two formulas A & B (marked by term1oc & term2oc in the
    succedents of s1 & s2) into a conjunction A And B.
    
    Let s1 have (sL |- sR, A) as its bottommost sequent and
    let s2 have (tL |- tR, B) as its bottommost sequent.
    
    The rule:
    (rest of s1)       (rest of s2)
    sL |- sR, A        tL |- tR, B
    ------------------------------ (AndRight)
       sL, tL |- sR, tR, A ∧ B
    

    s1

    The left proof with A in the succedent of its bottommost sequent.

    s2

    The right proof with B in the succedent of its bottommost sequent.

    term1oc

    The occurrence of A in s1.

    term2oc

    The occurrence of B in s2.

    returns

    An LK proof with s1 & s2 as its two subtrees and (sL, tL |- sR, tR, A ∧ B) as its bottommost sequent.

  7. final def asInstanceOf[T0]: T0

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  9. def computeLeftAux(main: HOLFormula): HOLFormula

    Permalink

    Returns the left subformula.

    Returns the left subformula.

    main

    A formula of the form l And r

    returns

    l.

  10. def computeRightAux(main: HOLFormula): HOLFormula

    Permalink

    Returns the right subformula.

    Returns the right subformula.

    main

    A formula of the form l And r

    returns

    r.

  11. final def eq(arg0: AnyRef): Boolean

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

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

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

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

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

    Permalink
    Definition Classes
    Any
  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. def unapply(proof: LKProof): Option[(LKProof, LKProof, OccSequent, FormulaOccurrence, FormulaOccurrence, FormulaOccurrence)]

    Permalink
  23. final def wait(): Unit

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

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

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

Inherited from AnyRef

Inherited from Any

Ungrouped