Class

at.logic.gapt.proofs.ral

RalNegT

Related Doc: package ral

Permalink

case class RalNegT(subProof: RalProof, idx: SequentIndex) extends SimpleOneFormulaRule with Product with Serializable

Source
ral.scala
Linear Supertypes
Serializable, Serializable, SimpleOneFormulaRule, OneFormulaRule, ContextRule[(Label, HOLFormula), RalProof], RalProof, SequentProof[(Label, HOLFormula), RalProof], DagProof[RalProof], Product, Equals, AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. RalNegT
  2. Serializable
  3. Serializable
  4. SimpleOneFormulaRule
  5. OneFormulaRule
  6. ContextRule
  7. RalProof
  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 RalNegT(subProof: RalProof, idx: SequentIndex)

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

    Permalink
    Implicit information
    This member is added by an implicit conversion from RalNegT to ArrowAssoc[RalNegT] 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. def auxFormulas: Seq[Seq[(Label, HOLFormula)]]

    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
  8. def auxIndices: Seq[Seq[SequentIndex]]

    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
    OneFormulaRule → SequentProof
  9. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. lazy val conclusion: Sequent[(Label, HOLFormula)]

    Permalink

    The conclusion of the rule.

    The conclusion of the rule.

    Definition Classes
    ContextRuleSequentProof
  11. def contexts: Seq[Sequent[(Label, HOLFormula)]]

    Permalink
    Attributes
    protected
    Definition Classes
    ContextRule
  12. def dagLike: DagLikeOps[RalProof]

    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
  13. 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
  14. def ensuring(cond: (RalNegT) ⇒ Boolean, msg: ⇒ Any): RalNegT

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    RalProof
  23. def formulasToBeDeleted: Seq[Seq[SequentIndex]]

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

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

    Permalink
    Definition Classes
    DagProof → AnyRef → Any
  26. val idx: SequentIndex

    Permalink
    Definition Classes
    RalNegT → OneFormulaRule
  27. def immediateSubProofs: Seq[RalProof]

    Permalink

    The immediate subproofs of this rule.

    The immediate subproofs of this rule.

    Definition Classes
    OneFormulaRule → DagProof
  28. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  29. def labels: Sequent[Label]

    Permalink
    Definition Classes
    RalProof
  30. def longName: String

    Permalink

    The name of this rule (in words).

    The name of this rule (in words).

    Definition Classes
    DagProof
  31. def mainFormulaSequent: Sequent[(Label, HOLFormula)]

    Permalink
    Definition Classes
    OneFormulaRule → ContextRule
  32. def mainFormulas: Seq[(Label, HOLFormula)]

    Permalink

    The list of main formulas of the rule.

    The list of main formulas of the rule.

    Definition Classes
    SequentProof
  33. 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
  34. def name: String

    Permalink

    The name of this rule (in symbols).

    The name of this rule (in symbols).

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

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

    Permalink
    Definition Classes
    RalNegT → SimpleOneFormulaRule
  37. def newLabelledFormulas: Sequent[(Label, HOLFormula)]

    Permalink
    Definition Classes
    SimpleOneFormulaRule → OneFormulaRule
  38. final def notify(): Unit

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

    Permalink
    Definition Classes
    AnyRef
  40. def occConnectors: Seq[OccConnector[(Label, HOLFormula)]]

    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 premises: Seq[Sequent[(Label, HOLFormula)]]

    Permalink

    The upper sequents of the rule.

    The upper sequents of the rule.

    Definition Classes
    SequentProof
  42. def stepString(subProofLabels: Map[Any, String]): String

    Permalink
    Attributes
    protected
    Definition Classes
    SequentProofDagProof
  43. lazy val sub: HOLFormula

    Permalink
  44. val subProof: RalProof

    Permalink
    Definition Classes
    RalNegT → OneFormulaRule
  45. def subProofs: Set[RalProof]

    Permalink

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

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

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

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

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

    Permalink
    Definition Classes
    DagProof → AnyRef → Any
  49. def treeLike: TreeLikeOps[RalProof]

    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
  50. final def wait(): Unit

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

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

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

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

Inherited from Serializable

Inherited from Serializable

Inherited from SimpleOneFormulaRule

Inherited from OneFormulaRule

Inherited from ContextRule[(Label, HOLFormula), RalProof]

Inherited from RalProof

Inherited from SequentProof[(Label, HOLFormula), RalProof]

Inherited from DagProof[RalProof]

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

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

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

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

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

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

Ungrouped