Packages

class QuantifiedTree extends ProofTreeOneChild

ProofTreeOneChild that quantifies a set of constants in the closing constraint of its subtree

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. QuantifiedTree
  2. ProofTreeOneChild
  3. ProofTree
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def bindingContext: BindingContext
    Definition Classes
    ProofTree
  6. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @HotSpotIntrinsicCandidate() @native()
  7. lazy val closingConstantFreedom: ConstantFreedom

    The constants that can be considered free (resp., that have to be considered non-free) in this proof tree.

    The constants that can be considered free (resp., that have to be considered non-free) in this proof tree.

    Definition Classes
    QuantifiedTreeProofTree
  8. lazy val closingConstraint: Conjunction

    The fully simplified closing constraint

    The fully simplified closing constraint

    Definition Classes
    QuantifiedTreeProofTree
  9. def constantFreedom: ConstantFreedom
    Definition Classes
    ProofTree
  10. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  11. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  12. lazy val fixedConstantFreedom: Boolean

    true if the sets of free constants have reached a fixed point

    true if the sets of free constants have reached a fixed point

    Definition Classes
    QuantifiedTreeProofTree
  13. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  14. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  15. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  16. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  17. def newConstantFreedomForSubtree(cf: ConstantFreedom): ConstantFreedom

    Given a new constant freedom for this proof tree, derive the corresponding freedom for the direct subtree.

    Given a new constant freedom for this proof tree, derive the corresponding freedom for the direct subtree.

    Definition Classes
    QuantifiedTreeProofTreeOneChild
  18. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  19. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  20. def order: TermOrder
    Definition Classes
    ProofTree
  21. val quan: Quantifier
  22. val quantifiedConstants: Seq[ConstantTerm]
  23. lazy val stepMeaningful: Boolean

    true if there are chances that the closingConstraint of this tree changes by applying rules to any goal

    true if there are chances that the closingConstraint of this tree changes by applying rules to any goal

    Definition Classes
    QuantifiedTreeProofTree
  24. lazy val stepPossible: Boolean

    true if it is possible to apply rules to any goal in this tree

    true if it is possible to apply rules to any goal in this tree

    Definition Classes
    ProofTreeOneChildProofTree
  25. val subtree: ProofTree
    Definition Classes
    QuantifiedTreeProofTreeOneChild
  26. val subtreeOrder: TermOrder
    Attributes
    protected
    Definition Classes
    QuantifiedTreeProofTreeOneChild
  27. lazy val subtrees: Seq[ProofTree]
    Definition Classes
    ProofTreeOneChildProofTree
  28. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  29. def toString(): String
    Definition Classes
    QuantifiedTree → AnyRef → Any
  30. def update(newSubtree: ProofTree, newConstantFreedom: ConstantFreedom): ProofTree

    Replace the subtree and the constant freedom status with new values.

    Replace the subtree and the constant freedom status with new values.

    Definition Classes
    QuantifiedTreeProofTreeOneChild
  31. val vocabulary: Vocabulary

    the vocabulary available at a certain node in the proof

    the vocabulary available at a certain node in the proof

    Definition Classes
    QuantifiedTreeProofTree
  32. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  33. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  34. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated

    (Since version 9)

Inherited from ProofTreeOneChild

Inherited from ProofTree

Inherited from AnyRef

Inherited from Any

Ungrouped