The tree E1.
The tree E2.
Tests whether the tree contains any weak quantifier nodes.
Tests whether the tree contains any weak quantifier nodes.
True iff there are weak quantifiers anywhere in the tree.
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.
The shallow formula of this node minus the quantifiers represented by it (if any).
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.
The tree E1.
Computes the number of instances in an expansion tree.
Computes the number of instances in an expansion tree.
The number of instances in the tree.
Returns the number of quantifiers represented by a node.
Returns the number of quantifiers represented by a node.
The number of quantifiers represented by this node.
The tree E2.
Computes the expansion tree's deep formula.
Computes the expansion tree's deep formula.
Determines whether the tree is negated (<0) or not (>0).
The deep formula.
Computes the expansion tree's shallow formula.
Computes the expansion tree's shallow formula.
The shallow formula.
Models a conjunction.
E1 ∧ E2
The tree E1.
The tree E2.