Object

at.logic.gapt.proofs.expansionTrees

METTop

Related Doc: package expansionTrees

Permalink

object METTop extends MultiExpansionTree with Product with Serializable

Linear Supertypes
Serializable, Serializable, Product, Equals, MultiExpansionTree, TreeA[Option[HOLFormula], Option[Seq[LambdaExpression]]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. METTop
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. MultiExpansionTree
  7. TreeA
  8. AnyRef
  9. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Value Members

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

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

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. def containsWeakQuantifiers: Boolean

    Permalink

    Tests whether the tree contains any weak quantifier nodes.

    Tests whether the tree contains any weak quantifier nodes.

    returns

    True iff there are weak quantifiers anywhere in the tree.

    Definition Classes
    METTopMultiExpansionTree
  7. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  8. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  9. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  10. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  11. def getSubformula: PropFormula

    Permalink

    Returns a node's shallow formula minus the quantifiers represented by that node.

    Returns a node's shallow formula minus the quantifiers represented by that node.

    returns

    The shallow formula of this node minus the quantifiers represented by it (if any).

    Definition Classes
    METTopMultiExpansionTree
  12. def getVars: Nil.type

    Permalink

    Gets the list of variables instantiated by this node.

    Gets the list of variables instantiated by this node. It will be empty for non-quantifier nodes.

    Definition Classes
    METTopMultiExpansionTree
  13. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  14. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  15. lazy val node: Some[PropFormula]

    Permalink
  16. final def notify(): Unit

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

    Permalink
    Definition Classes
    AnyRef
  18. def numberOfInstances: Int

    Permalink

    Computes the number of instances in an expansion tree.

    Computes the number of instances in an expansion tree.

    returns

    The number of instances in the tree.

    Definition Classes
    METTopMultiExpansionTree
  19. def numberOfQuantifiers: Int

    Permalink

    Returns the number of quantifiers represented by a node.

    Returns the number of quantifiers represented by a node.

    returns

    The number of quantifiers represented by this node.

    Definition Classes
    METTopMultiExpansionTree
  20. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  21. def toDeep(pol: Int): PropFormula

    Permalink

    Computes the expansion tree's deep formula.

    Computes the expansion tree's deep formula.

    pol

    Determines whether the tree is negated (<0) or not (>0).

    returns

    The deep formula.

    Definition Classes
    METTopMultiExpansionTree
  22. def toShallow: PropFormula

    Permalink

    Computes the expansion tree's shallow formula.

    Computes the expansion tree's shallow formula.

    returns

    The shallow formula.

    Definition Classes
    METTopMultiExpansionTree
  23. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from MultiExpansionTree

Inherited from TreeA[Option[HOLFormula], Option[Seq[LambdaExpression]]]

Inherited from AnyRef

Inherited from Any

Ungrouped