Class

at.logic.gapt.proofs.lkNew

InductionRule

Related Doc: package lkNew

Permalink

case class InductionRule(leftSubProof: LKProof, aux1: SequentIndex, rightSubProof: LKProof, aux2: SequentIndex, aux3: SequentIndex, term: FOLTerm) extends BinaryLKProof with Product with Serializable

Linear Supertypes
Serializable, Serializable, BinaryLKProof, LKProof, SequentProof[HOLFormula, LKProof], DagProof[LKProof], Product, Equals, AnyRef, Any
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. InductionRule
  2. Serializable
  3. Serializable
  4. BinaryLKProof
  5. LKProof
  6. SequentProof
  7. DagProof
  8. Product
  9. Equals
  10. AnyRef
  11. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Instance Constructors

  1. new InductionRule(leftSubProof: LKProof, aux1: SequentIndex, rightSubProof: LKProof, aux2: SequentIndex, aux3: SequentIndex, term: FOLTerm)

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  6. val aSx: FOLFormula

    Permalink
  7. val aX: FOLFormula

    Permalink
  8. val aZero: FOLFormula

    Permalink
  9. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  10. val aux1: SequentIndex

    Permalink
  11. val aux2: SequentIndex

    Permalink
  12. val aux3: SequentIndex

    Permalink
  13. def auxFormulas: Seq[Seq[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
  14. 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
    InductionRuleSequentProof
  15. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  16. def conclusion: HOLSequent

    Permalink

    The conclusion of the rule.

    The conclusion of the rule.

    Definition Classes
    LKProofSequentProof
  17. def dagLikeForeach(f: (LKProof) ⇒ Unit): Set[LKProof]

    Permalink

    Iterate over all sub-proofs including this in post-order, ignoring duplicates.

    Iterate over all sub-proofs including this in post-order, ignoring duplicates.

    returns

    Set of all visited sub-proofs including this.

    Definition Classes
    DagProof
  18. def dagLikePostOrder: Seq[LKProof]

    Permalink

    A sequence of all sub-proofs including this in post-order, ignoring duplicates.

    A sequence of all sub-proofs including this in post-order, ignoring duplicates.

    Definition Classes
    DagProof
  19. def endSequent: Sequent[HOLFormula]

    Permalink

    The end-sequent of the rule.

    The end-sequent of the rule.

    Definition Classes
    InductionRuleLKProof
  20. def ensuring(cond: (InductionRule) ⇒ Boolean, msg: ⇒ Any): InductionRule

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

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

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

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

    Permalink
    Definition Classes
    AnyRef
  25. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  26. def foreach(f: (LKProof) ⇒ Unit): Unit

    Permalink

    Iterate over all sub-proofs including this in post-order.

    Iterate over all sub-proofs including this in post-order.

    Definition Classes
    DagProof
  27. def formatted(fmtstr: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from InductionRule to StringFormat[InductionRule] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  28. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  29. def getLeftOccConnector: OccConnector

    Permalink

    The object connecting the lower and left upper sequents.

    The object connecting the lower and left upper sequents.

    Definition Classes
    InductionRuleBinaryLKProof
  30. def getRightOccConnector: OccConnector

    Permalink

    The object connecting the lower and right upper sequents.

    The object connecting the lower and right upper sequents.

    Definition Classes
    InductionRuleBinaryLKProof
  31. val hashCode: Int

    Permalink
    Definition Classes
    DagProof → AnyRef → Any
  32. def immediateSubProofs: Seq[LKProof]

    Permalink

    The immediate subproofs of this rule.

    The immediate subproofs of this rule.

    Definition Classes
    BinaryLKProofDagProof
  33. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  34. def leftPremise: HOLSequent

    Permalink

    The left upper sequent of the rule.

    The left upper sequent of the rule.

    Definition Classes
    BinaryLKProof
  35. val leftSubProof: LKProof

    Permalink

    The immediate left subproof of the rule.

    The immediate left subproof of the rule.

    Definition Classes
    InductionRuleBinaryLKProof
  36. def longName: String

    Permalink

    The name of the rule (in words).

    The name of the rule (in words).

    Definition Classes
    DagProof
  37. val mainFormula: FOLFormula

    Permalink
  38. def mainFormulas: Seq[HOLFormula]

    Permalink

    The list of main formulas of the rule.

    The list of main formulas of the rule.

    Definition Classes
    SequentProof
  39. def mainIndices: Seq[Suc]

    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
    InductionRuleSequentProof
  40. val mainSub: FOLSubstitution

    Permalink
  41. def name: String

    Permalink

    The name of the rule (in symbols).

    The name of the rule (in symbols).

    Definition Classes
    InductionRuleDagProof
  42. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  43. final def notify(): Unit

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

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

    Permalink

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

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

    Definition Classes
    BinaryLKProofSequentProof
  46. def postOrder: Seq[LKProof]

    Permalink

    A sequence of all sub-proofs including this in post-order.

    A sequence of all sub-proofs including this in post-order.

    Definition Classes
    DagProof
  47. def premises: Seq[Sequent[HOLFormula]]

    Permalink

    The upper sequents of the rule.

    The upper sequents of the rule.

    Definition Classes
    SequentProof
  48. def rightPremise: HOLSequent

    Permalink

    The right upper sequent of the rule.

    The right upper sequent of the rule.

    Definition Classes
    BinaryLKProof
  49. val rightSubProof: LKProof

    Permalink

    The immediate right subproof of the rule.

    The immediate right subproof of the rule.

    Definition Classes
    InductionRuleBinaryLKProof
  50. val sX: FOLTerm

    Permalink
  51. def stepString(subProofLabels: Map[Any, String]): String

    Permalink
    Attributes
    protected
    Definition Classes
    SequentProofDagProof
  52. val sub1: FOLSubstitution

    Permalink
  53. val sub2: FOLSubstitution

    Permalink
  54. def subProofs: Set[LKProof]

    Permalink

    Set of all sub-proofs including this.

    Set of all sub-proofs including this.

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

    Permalink
    Definition Classes
    AnyRef
  56. val term: FOLTerm

    Permalink
  57. def toString(): String

    Permalink
    Definition Classes
    DagProof → AnyRef → Any
  58. def validateIndices(premise: HOLSequent, 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
    LKProof
  59. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  62. val x: FOLVar

    Permalink
  63. def [B](y: B): (InductionRule, B)

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

Inherited from Serializable

Inherited from Serializable

Inherited from BinaryLKProof

Inherited from LKProof

Inherited from SequentProof[HOLFormula, LKProof]

Inherited from DagProof[LKProof]

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

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

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

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

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

Ungrouped