Class

at.logic.gapt.proofs.lksk

NegLeft

Related Doc: package lksk

Permalink

case class NegLeft(subProof: LKskProof, aux: Suc) extends UnaryRule with SameLabel with Product with Serializable

Source
lkskNew.scala
Linear Supertypes
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. NegLeft
  2. Serializable
  3. Serializable
  4. SameLabel
  5. UnaryRule
  6. LKskProof
  7. ContextRule
  8. SequentProof
  9. DagProof
  10. Product
  11. Equals
  12. AnyRef
  13. Any
Implicitly
  1. by CollectionsHaveToParArray
  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 NegLeft(subProof: LKskProof, aux: Suc)

    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 NegLeft to any2stringadd[NegLeft] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ->[B](y: B): (NegLeft, B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from NegLeft to ArrowAssoc[NegLeft] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  5. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  6. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  7. val aux: Suc

    Permalink
  8. def auxFormulas: Seq[Seq[LabelledFormula]]

    Permalink

    A list of lists containing the auxiliary formulas of the rule.

    A list of lists containing the auxiliary formulas of the rule. The first list constains the auxiliary formulas in the first premise and so on.

    Definition Classes
    SequentProof
  9. def auxIndices: Seq[Seq[Suc]]

    Permalink

    A list of lists of SequentIndices denoting the auxiliary formula(s) of the rule.

    A list of lists of SequentIndices denoting the auxiliary formula(s) of the rule. The first list contains the auxiliary formulas in the first premise and so on.

    Definition Classes
    NegLeftSequentProof
  10. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  11. lazy val conclusion: Sequent[LabelledFormula]

    Permalink

    The conclusion of the rule.

    The conclusion of the rule.

    Definition Classes
    ContextRuleSequentProof
  12. def contexts: Seq[Sequent[LabelledFormula]]

    Permalink
    Attributes
    protected
    Definition Classes
    ContextRule
  13. def dagLike: DagLikeOps[LKskProof]

    Permalink

    Operations that view the sub-proofs as a DAG, which ignore duplicate sub-proofs, see DagProof.DagLikeOps for a list.

    Operations that view the sub-proofs as a DAG, which ignore duplicate sub-proofs, see DagProof.DagLikeOps for a list.

    Definition Classes
    DagProof
  14. def depth: Int

    Permalink

    Depth of the proof, which is the maximum length of a path you can take via immediateSubProofs.

    Depth of the proof, which is the maximum length of a path you can take via immediateSubProofs.

    Definition Classes
    DagProof
  15. def ensuring(cond: (NegLeft) ⇒ Boolean, msg: ⇒ Any): NegLeft

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

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

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

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

    Permalink
    Definition Classes
    AnyRef
  20. def equals(that: Any): Boolean

    Permalink
    Definition Classes
    DagProof → Equals → AnyRef → Any
  21. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  22. def formatted(fmtstr: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from NegLeft to StringFormat[NegLeft] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  23. def formulas: Sequent[HOLFormula]

    Permalink
    Definition Classes
    LKskProof
  24. def formulasToBeDeleted: Seq[Seq[SequentIndex]]

    Permalink
    Attributes
    protected
    Definition Classes
    ContextRule
  25. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  26. val hashCode: Int

    Permalink
    Definition Classes
    DagProof → AnyRef → Any
  27. def immediateSubProofs: Seq[LKskProof]

    Permalink

    The immediate subproofs of this rule.

    The immediate subproofs of this rule.

    Definition Classes
    UnaryRuleDagProof
  28. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  29. val label: Label

    Permalink
    Definition Classes
    SameLabel
  30. def labels: Sequent[Label]

    Permalink
    Definition Classes
    LKskProof
  31. def longName: String

    Permalink

    The name of this rule (in words).

    The name of this rule (in words).

    Definition Classes
    DagProof
  32. val mainFormulaSequent: Sequent[(Label, HOLFormula)]

    Permalink
    Definition Classes
    SameLabelContextRule
  33. def mainFormulas: Seq[LabelledFormula]

    Permalink

    The list of main formulas of the rule.

    The list of main formulas of the rule.

    Definition Classes
    SequentProof
  34. def mainIndices: Seq[SequentIndex]

    Permalink

    A list of SequentIndices denoting the main formula(s) of the rule.

    A list of SequentIndices denoting the main formula(s) of the rule.

    Definition Classes
    ContextRuleSequentProof
  35. def name: String

    Permalink

    The name of this rule (in symbols).

    The name of this rule (in symbols).

    Definition Classes
    DagProof
  36. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  37. lazy val newFormulas: Sequent[HOLFormula]

    Permalink
    Definition Classes
    NegLeftSameLabel
  38. final def notify(): Unit

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

    Permalink
    Definition Classes
    AnyRef
  40. def occConnectors: Seq[OccConnector[LabelledFormula]]

    Permalink

    A list of occurrence connectors, one for each immediate subproof.

    A list of occurrence connectors, one for each immediate subproof.

    Definition Classes
    ContextRuleSequentProof
  41. def premise: Sequent[LabelledFormula]

    Permalink
    Definition Classes
    UnaryRule
  42. def premises: Seq[Sequent[LabelledFormula]]

    Permalink

    The upper sequents of the rule.

    The upper sequents of the rule.

    Definition Classes
    SequentProof
  43. def requireEq[T](a: T, b: T): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    LKskProof
  44. def stepString(subProofLabels: Map[Any, String]): String

    Permalink
    Attributes
    protected
    Definition Classes
    SequentProofDagProof
  45. val subProof: LKskProof

    Permalink
    Definition Classes
    NegLeftUnaryRule
  46. def subProofs: Set[LKskProof]

    Permalink

    Set of all (transitive) sub-proofs including this.

    Set of all (transitive) sub-proofs including this.

    Definition Classes
    DagProof
  47. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  48. def toParArray: ParArray[T]

    Permalink
    Implicit information
    This member is added by an implicit conversion from NegLeft to CollectionsHaveToParArray[NegLeft, T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (NegLeft) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  49. def toString(): String

    Permalink
    Definition Classes
    DagProof → AnyRef → Any
  50. def treeLike: TreeLikeOps[LKskProof]

    Permalink

    Operations that view the sub-proofs as a tree, see DagProof.TreeLikeOps for a list.

    Operations that view the sub-proofs as a tree, see DagProof.TreeLikeOps for a list.

    Definition Classes
    DagProof
  51. def validateIndices(premise: LabelledSequent, antecedentIndices: Seq[SequentIndex], succedentIndices: Seq[SequentIndex]): Unit

    Permalink

    Checks whether indices are in the right place and premise is defined at all of them.

    Checks whether indices are in the right place and premise is defined at all of them.

    premise

    The sequent to be checked.

    antecedentIndices

    Indices that should be in the antecedent.

    succedentIndices

    Indices that should be in the succedent.

    Attributes
    protected
    Definition Classes
    LKskProof
  52. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  55. def [B](y: B): (NegLeft, B)

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

Inherited from Serializable

Inherited from Serializable

Inherited from SameLabel

Inherited from UnaryRule

Inherited from LKskProof

Inherited from DagProof[LKskProof]

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion CollectionsHaveToParArray from NegLeft to CollectionsHaveToParArray[NegLeft, T]

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

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

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

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

Ungrouped