Class

at.logic.gapt.proofs.lksk

LabelledOccSequent

Related Doc: package lksk

Permalink

case class LabelledOccSequent(l_antecedent: Seq[LabelledFormulaOccurrence], l_succedent: Seq[LabelledFormulaOccurrence]) extends OccSequent with Product with Serializable

Linear Supertypes
Serializable, Serializable, Product, Equals, Sequent[FormulaOccurrence], AnyRef, Any
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. LabelledOccSequent
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. Sequent
  7. AnyRef
  8. Any
Implicitly
  1. by RichOccSequent
  2. by any2stringadd
  3. by StringFormat
  4. by Ensuring
  5. by ArrowAssoc
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Instance Constructors

  1. new LabelledOccSequent(l_antecedent: Seq[LabelledFormulaOccurrence], l_succedent: Seq[LabelledFormulaOccurrence])

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. def +(other: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from LabelledOccSequent to any2stringadd[LabelledOccSequent] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ++[B >: FormulaOccurrence](that: Sequent[B]): Sequent[B]

    Permalink
    Definition Classes
    Sequent
  5. def ++:[B >: FormulaOccurrence](es: GenTraversable[B]): Sequent[B]

    Permalink

    Adds a sequent of elements to the antecedent.

    Adds a sequent of elements to the antecedent. New elements are always outermost, i.e. on the very left.

    es

    A collection of elements of type B > A.

    returns

    The sequent with es added to the antecedent.

    Definition Classes
    Sequent
  6. def +:[B >: FormulaOccurrence](e: B): Sequent[B]

    Permalink

    Adds an element to the antecedent.

    Adds an element to the antecedent. New elements are always outermost, i.e. on the very left.

    e

    An element of type B > A

    returns

    The sequent with e added to the antecedent

    Definition Classes
    Sequent
  7. def ->[B](y: B): (LabelledOccSequent, B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from LabelledOccSequent to ArrowAssoc[LabelledOccSequent] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  8. def :+[B >: FormulaOccurrence](e: B): Sequent[B]

    Permalink

    Adds an element to the succedent.

    Adds an element to the succedent. New elements are always outermost, i.e. on the very right.

    e

    An element of type B > A

    returns

    The sequent with e added to the succedent

    Definition Classes
    Sequent
  9. def :++[B >: FormulaOccurrence](es: GenTraversable[B]): Sequent[B]

    Permalink

    Adds a sequence of elements to the succedent.

    Adds a sequence of elements to the succedent. New elements are always outermost, i.e. on the very right.

    es

    A collection of elements of type B > A.

    returns

    The sequent with es added to the succedent.

    Definition Classes
    Sequent
  10. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  11. def =^(o: OccSequent): Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from LabelledOccSequent to RichOccSequent performed by method RichOccSequent in at.logic.gapt.proofs.lk.base.
    Definition Classes
    RichOccSequent
  12. def addToAntecedent[B >: FormulaOccurrence](e: B): Sequent[B]

    Permalink

    Adds an element to the antecedent.

    Adds an element to the antecedent. New elements are always outermost, i.e. on the very left.

    e

    An element of type B > A

    returns

    The sequent with e added to the antecedent

    Definition Classes
    Sequent
  13. def addToSuccedent[B >: FormulaOccurrence](e: B): Sequent[B]

    Permalink

    Adds an element to the succedent.

    Adds an element to the succedent. New elements are always outermost, i.e. on the very right.

    e

    An element of type B > A

    returns

    The sequent with e added to the succedent

    Definition Classes
    Sequent
  14. val antecedent: Seq[FormulaOccurrence]

    Permalink

    The first list.

    The first list.

    Definition Classes
    Sequent
  15. def apply(is: Seq[SequentIndex]): Seq[FormulaOccurrence]

    Permalink
    Definition Classes
    Sequent
  16. def apply(i: SequentIndex): FormulaOccurrence

    Permalink

    Returns the element at some SequentIndex.

    Returns the element at some SequentIndex.

    i

    A SequentIndex, i.e. Ant(k) or Suc(k)

    returns

    The k-th element of the antecedent or succedent, depending on the type of i.

    Definition Classes
    Sequent
  17. final def asInstanceOf[T0]: T0

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  19. def compose(that: LabelledOccSequent): LabelledOccSequent

    Permalink
  20. def compose[B >: FormulaOccurrence](other: Sequent[B]): Sequent[B]

    Permalink
    Definition Classes
    Sequent
  21. def contains[B](el: B): Boolean

    Permalink

    Returns true iff the sequent contains some element in either cedent.

    Returns true iff the sequent contains some element in either cedent.

    Definition Classes
    Sequent
  22. def delete(i: SequentIndex): Sequent[FormulaOccurrence]

    Permalink
    Definition Classes
    Sequent
  23. def diff[B >: FormulaOccurrence](other: Sequent[B]): Sequent[FormulaOccurrence]

    Permalink

    Takes the multiset difference between two sequents, i.e.

    Takes the multiset difference between two sequents, i.e. each side separately.

    Definition Classes
    Sequent
  24. def distinct: Sequent[FormulaOccurrence]

    Permalink

    Removes duplicate formulas from both cedents.

    Removes duplicate formulas from both cedents.

    Definition Classes
    Sequent
  25. def elements: Seq[FormulaOccurrence]

    Permalink

    Sequence of elements of the sequent.

    Sequence of elements of the sequent.

    returns

    Antecedent concatenated with succedent.

    Definition Classes
    Sequent
  26. def ensuring(cond: (LabelledOccSequent) ⇒ Boolean, msg: ⇒ Any): LabelledOccSequent

    Permalink
    Implicit information
    This member is added by an implicit conversion from LabelledOccSequent to Ensuring[LabelledOccSequent] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  27. def ensuring(cond: (LabelledOccSequent) ⇒ Boolean): LabelledOccSequent

    Permalink
    Implicit information
    This member is added by an implicit conversion from LabelledOccSequent to Ensuring[LabelledOccSequent] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  28. def ensuring(cond: Boolean, msg: ⇒ Any): LabelledOccSequent

    Permalink
    Implicit information
    This member is added by an implicit conversion from LabelledOccSequent to Ensuring[LabelledOccSequent] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  29. def ensuring(cond: Boolean): LabelledOccSequent

    Permalink
    Implicit information
    This member is added by an implicit conversion from LabelledOccSequent to Ensuring[LabelledOccSequent] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  30. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  31. def equals(other: Any): Boolean

    Permalink

    Equality treating each side of the sequent as list, i.e.

    Equality treating each side of the sequent as list, i.e. respecting order and multiplicity.

    Definition Classes
    Sequent → AnyRef → Any
  32. def filter(p: (FormulaOccurrence) ⇒ Boolean): Sequent[FormulaOccurrence]

    Permalink

    The sub-sequent of elements satisfying some predicate.

    The sub-sequent of elements satisfying some predicate.

    p

    A function of type A => Boolean.

    returns

    The sequent consisting of only those elements satisfying p.

    Definition Classes
    Sequent
  33. def filterNot(p: (FormulaOccurrence) ⇒ Boolean): Sequent[FormulaOccurrence]

    Permalink

    The sub-sequent of elements not satisfying some predicate.

    The sub-sequent of elements not satisfying some predicate.

    p

    A function of type A => Boolean.

    returns

    The sequent consisting of only those elements not satisfying p.

    Definition Classes
    Sequent
  34. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  35. def find(pred: (FormulaOccurrence) ⇒ Boolean): Option[SequentIndex]

    Permalink
    Definition Classes
    Sequent
  36. def focus(i: SequentIndex): (FormulaOccurrence, Sequent[FormulaOccurrence])

    Permalink

    "Focuses on one element of the seuqent, i.e.

    "Focuses on one element of the seuqent, i.e. returns element at index and the rest of the sequent.

    i

    A SequentIndex.

    returns

    A pair consisting of this(i) and the rest of this.

    Definition Classes
    Sequent
  37. def formatted(fmtstr: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from LabelledOccSequent to StringFormat[LabelledOccSequent] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  38. def freeVariables: Set[Var]

    Permalink
    Implicit information
    This member is added by an implicit conversion from LabelledOccSequent to RichOccSequent performed by method RichOccSequent in at.logic.gapt.proofs.lk.base.
    Definition Classes
    RichOccSequent
  39. def getChildOf(ancestor: FormulaOccurrence): Option[FormulaOccurrence]

    Permalink

    Finds the first occurrence in this sequent having the given ancestor.

    Finds the first occurrence in this sequent having the given ancestor.

    Implicit information
    This member is added by an implicit conversion from LabelledOccSequent to RichOccSequent performed by method RichOccSequent in at.logic.gapt.proofs.lk.base.
    Definition Classes
    RichOccSequent
  40. final def getClass(): Class[_]

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

    Permalink
    Definition Classes
    Sequent → AnyRef → Any
  42. def indices: Seq[SequentIndex]

    Permalink

    Returns the range of indices of the sequent as a sequence.

    Returns the range of indices of the sequent as a sequence.

    Definition Classes
    Sequent
  43. def indicesSequent: Sequent[SequentIndex]

    Permalink

    Returns the range of indices of the sequent as a sequent.

    Returns the range of indices of the sequent as a sequent.

    Definition Classes
    Sequent
  44. def indicesWhere(p: (FormulaOccurrence) ⇒ Boolean): Seq[SequentIndex]

    Permalink

    Returns the list of indices of elements satisfying some predicate.

    Returns the list of indices of elements satisfying some predicate.

    p

    A function of type A => Boolean.

    Definition Classes
    Sequent
  45. def intersect[B >: FormulaOccurrence](other: Sequent[B]): Sequent[FormulaOccurrence]

    Permalink

    Computes the intersection of two sequents.

    Computes the intersection of two sequents.

    Definition Classes
    Sequent
  46. def isDefinedAt(i: SequentIndex): Boolean

    Permalink

    Tests whether the sequent is defined at the supplied SequentIndex.

    Tests whether the sequent is defined at the supplied SequentIndex.

    Definition Classes
    Sequent
  47. def isEmpty: Boolean

    Permalink

    Returns true iff both cedents are empty.

    Returns true iff both cedents are empty.

    Definition Classes
    Sequent
  48. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  49. def isReflexivity: Boolean

    Permalink

    Is this sequent of the form :- t = t?

    Is this sequent of the form :- t = t?

    Implicit information
    This member is added by an implicit conversion from LabelledOccSequent to RichOccSequent performed by method RichOccSequent in at.logic.gapt.proofs.lk.base.
    Definition Classes
    RichOccSequent
  50. def isSubMultisetOf[B >: FormulaOccurrence](other: Sequent[B]): Boolean

    Permalink
    Definition Classes
    Sequent
  51. def isSubsetOf[B >: FormulaOccurrence](other: Sequent[B]): Boolean

    Permalink

    other

    Another Sequent.

    returns

    True iff other contains this pair of sets.

    Definition Classes
    Sequent
  52. def isTaut: Boolean

    Permalink

    Is this sequent of the form F :- F?

    Is this sequent of the form F :- F?

    Implicit information
    This member is added by an implicit conversion from LabelledOccSequent to RichOccSequent performed by method RichOccSequent in at.logic.gapt.proofs.lk.base.
    Definition Classes
    RichOccSequent
  53. val l_antecedent: Seq[LabelledFormulaOccurrence]

    Permalink
  54. val l_succedent: Seq[LabelledFormulaOccurrence]

    Permalink
  55. def length: Int

    Permalink

    The number of elements in the sequent.

    The number of elements in the sequent.

    Definition Classes
    Sequent
  56. def lengths: (Int, Int)

    Permalink

    A pair consisting of the lengths of the cedents.

    A pair consisting of the lengths of the cedents.

    Definition Classes
    Sequent
  57. def map[B](f: (FormulaOccurrence) ⇒ B, g: (FormulaOccurrence) ⇒ B): Sequent[B]

    Permalink

    Maps two functions over the antecedent and succedent, respectively.

    Maps two functions over the antecedent and succedent, respectively.

    B

    The return type of f and g.

    f

    The function to map over the antecedent.

    g

    The function to map over the succedent.

    returns

    The sequent of type B that results from mapping f and g over the antecedent and succedent, respectively.

    Definition Classes
    Sequent
  58. def map[B](f: (FormulaOccurrence) ⇒ B): Sequent[B]

    Permalink

    Maps a function over both cedents

    Maps a function over both cedents

    B

    The return type of f

    f

    A function of type A => B

    returns

    The sequent of type B that results from mapping f over both cedents.

    Definition Classes
    Sequent
  59. def multiSetEquals[B](other: Sequent[B]): Boolean

    Permalink

    Equality treating each side of the sequent as a multiset.

    Equality treating each side of the sequent as a multiset.

    Definition Classes
    Sequent
  60. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  61. def nonEmpty: Boolean

    Permalink
    Definition Classes
    Sequent
  62. final def notify(): Unit

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

    Permalink
    Definition Classes
    AnyRef
  64. def occurrences: Seq[FormulaOccurrence]

    Permalink

    Occurrences on both sides of the sequent, i.e.

    Occurrences on both sides of the sequent, i.e. the concatenation of antecedent and succedent.

    Implicit information
    This member is added by an implicit conversion from LabelledOccSequent to RichOccSequent performed by method RichOccSequent in at.logic.gapt.proofs.lk.base.
    Definition Classes
    RichOccSequent
  65. def polarizedElements: Seq[(FormulaOccurrence, Boolean)]

    Permalink

    Sequence of elements together with polarities of type Boolean signifying whether an element is in the antecedent or succedent.

    Sequence of elements together with polarities of type Boolean signifying whether an element is in the antecedent or succedent.

    FIXME: Make polarities consistent throughout the system (IMO: false = antecedent, true = succedent)

    Definition Classes
    Sequent
  66. def removeFormulasAtOccurrences(occs: Seq[FormulaOccurrence]): OccSequent

    Permalink

    Removes the specified at.logic.gapt.proofs.occurrences.FormulaOccurrences from each side.

    Removes the specified at.logic.gapt.proofs.occurrences.FormulaOccurrences from each side.

    Implicit information
    This member is added by an implicit conversion from LabelledOccSequent to RichOccSequent performed by method RichOccSequent in at.logic.gapt.proofs.lk.base.
    Definition Classes
    RichOccSequent
  67. def removeFromAntecedent[B](e: B): Sequent[FormulaOccurrence]

    Permalink
    Definition Classes
    Sequent
  68. def removeFromSuccedent[B](e: B): Sequent[FormulaOccurrence]

    Permalink
    Definition Classes
    Sequent
  69. def replaceInAntecedent[B, C](from: B, to: C): Sequent[Any]

    Permalink
    Definition Classes
    Sequent
  70. def replaceInSuccedent[B, C](from: B, to: C): Sequent[Any]

    Permalink
    Definition Classes
    Sequent
  71. val sequent: Sequent[FormulaOccurrence]

    Permalink
    Implicit information
    This member is added by an implicit conversion from LabelledOccSequent to RichOccSequent performed by method RichOccSequent in at.logic.gapt.proofs.lk.base.
    Definition Classes
    RichOccSequent
  72. def setEquals[B](other: Sequent[B]): Boolean

    Permalink

    Equality treating each side of the sequent as a set.

    Equality treating each side of the sequent as a set.

    Definition Classes
    Sequent
  73. def size: Int

    Permalink

    Synonym for length.

    Synonym for length.

    Definition Classes
    Sequent
  74. def sizes: (Int, Int)

    Permalink

    Synonym for lengths.

    Synonym for lengths.

    Definition Classes
    Sequent
  75. def sorted[B >: FormulaOccurrence](implicit ordering: Ordering[B]): Sequent[FormulaOccurrence]

    Permalink
    Definition Classes
    Sequent
  76. val succedent: Seq[FormulaOccurrence]

    Permalink

    The second list.

    The second list.

    Definition Classes
    Sequent
  77. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  78. def syntacticMultisetEquals(o: HOLSequent)(implicit dummy: DummyImplicit): Boolean

    Permalink

    Equality treating each side as a multiset of formulas, ignoring the occurrence.

    Equality treating each side as a multiset of formulas, ignoring the occurrence.

    Implicit information
    This member is added by an implicit conversion from LabelledOccSequent to RichOccSequent performed by method RichOccSequent in at.logic.gapt.proofs.lk.base.
    Definition Classes
    RichOccSequent
  79. def syntacticMultisetEquals(o: OccSequent): Boolean

    Permalink

    Equality treating each side as a multiset of formulas, ignoring the occurrence.

    Equality treating each side as a multiset of formulas, ignoring the occurrence.

    Implicit information
    This member is added by an implicit conversion from LabelledOccSequent to RichOccSequent performed by method RichOccSequent in at.logic.gapt.proofs.lk.base.
    Definition Classes
    RichOccSequent
  80. def toFormula: HOLFormula

    Permalink

    Interpretation of the sequent as formula.

    Interpretation of the sequent as formula.

    Implicit information
    This member is added by an implicit conversion from LabelledOccSequent to RichOccSequent performed by method RichOccSequent in at.logic.gapt.proofs.lk.base.
    Definition Classes
    RichOccSequent
  81. def toHOLSequent: HOLSequent

    Permalink

    Converts to a HOLSequent, ignoring where the formulas occur.

    Converts to a HOLSequent, ignoring where the formulas occur.

    Implicit information
    This member is added by an implicit conversion from LabelledOccSequent to RichOccSequent performed by method RichOccSequent in at.logic.gapt.proofs.lk.base.
    Definition Classes
    RichOccSequent
  82. def toString(): String

    Permalink
    Definition Classes
    LabelledOccSequentSequent → AnyRef → Any
  83. def toTuple: (Seq[FormulaOccurrence], Seq[FormulaOccurrence])

    Permalink

    returns

    The sequent in tuple form.

    Definition Classes
    Sequent
  84. def union[B >: FormulaOccurrence](other: Sequent[B]): Sequent[B]

    Permalink

    Computes the union of two sequents.

    Computes the union of two sequents.

    Definition Classes
    Sequent
  85. def updated[B >: FormulaOccurrence](index: SequentIndex, elem: B): Sequent[B]

    Permalink
    Definition Classes
    Sequent
  86. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  89. def zipWithIndex: Sequent[(FormulaOccurrence, SequentIndex)]

    Permalink
    Definition Classes
    Sequent
  90. def [B](y: B): (LabelledOccSequent, B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from LabelledOccSequent to ArrowAssoc[LabelledOccSequent] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from Sequent[FormulaOccurrence]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion RichOccSequent from LabelledOccSequent to RichOccSequent

Inherited by implicit conversion any2stringadd from LabelledOccSequent to any2stringadd[LabelledOccSequent]

Inherited by implicit conversion StringFormat from LabelledOccSequent to StringFormat[LabelledOccSequent]

Inherited by implicit conversion Ensuring from LabelledOccSequent to Ensuring[LabelledOccSequent]

Inherited by implicit conversion ArrowAssoc from LabelledOccSequent to ArrowAssoc[LabelledOccSequent]

Ungrouped