Class

at.logic.gapt.proofs.expansionTrees

METAnd

Related Doc: package expansionTrees

Permalink

case class METAnd(left: MultiExpansionTree, right: MultiExpansionTree) extends MultiExpansionTree with T1 with Product with Serializable

Models a conjunction.

E1 ∧ E2

left

The tree E1.

right

The tree E2.

Linear Supertypes
Serializable, Serializable, Product, Equals, NonTerminalNodeA[Option[HOLFormula], Option[Seq[LambdaExpression]]], MultiExpansionTree, TreeA[Option[HOLFormula], Option[Seq[LambdaExpression]]], AnyRef, Any
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. METAnd
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. NonTerminalNodeA
  7. MultiExpansionTree
  8. TreeA
  9. AnyRef
  10. 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 METAnd(left: MultiExpansionTree, right: MultiExpansionTree)

    Permalink

    left

    The tree E1.

    right

    The tree E2.

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

    Permalink
    Implicit information
    This member is added by an implicit conversion from METAnd to ArrowAssoc[METAnd] 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. lazy val children: List[(MultiExpansionTree, None.type)]

    Permalink
    Definition Classes
    METAndNonTerminalNodeA
  8. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  9. 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
    METAndMultiExpansionTree
  10. def ensuring(cond: (METAnd) ⇒ Boolean, msg: ⇒ Any): METAnd

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  18. def getSubformula: HOLFormula

    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
    METAndMultiExpansionTree
  19. 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
    METAndMultiExpansionTree
  20. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  21. val left: MultiExpansionTree

    Permalink

    The tree E1.

  22. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  23. val node: None.type

    Permalink
    Definition Classes
    METAndNonTerminalNodeA
  24. final def notify(): Unit

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

    Permalink
    Definition Classes
    AnyRef
  26. 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
    METAndMultiExpansionTree
  27. 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
    METAndMultiExpansionTree
  28. val right: MultiExpansionTree

    Permalink

    The tree E2.

  29. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  30. def toDeep(pol: Int): HOLFormula

    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
    METAndMultiExpansionTree
  31. def toParArray: ParArray[T]

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

    Permalink

    Computes the expansion tree's shallow formula.

    Computes the expansion tree's shallow formula.

    returns

    The shallow formula.

    Definition Classes
    METAndMultiExpansionTree
  33. final def wait(): Unit

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

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

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

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

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

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

Inherited from MultiExpansionTree

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

Inherited from AnyRef

Inherited from Any

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

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

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

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

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

Ungrouped