Restricting negation-normal AC0 formulas #
Finite-arity restrictions substitute fixed literals by constants while retaining the unbounded connective tree. Evaluation commutes with this operation, tree size and depth are preserved exactly, and variable support is filtered to the free variables.
Apply a finite-arity restriction to an AC0 formula.
Equations
- One or more equations did not get rendered due to their size.
- Complexity.AC0Formula.restrict restriction (Complexity.AC0Formula.const value) = Complexity.AC0Formula.const value
- Complexity.AC0Formula.restrict restriction (Complexity.AC0Formula.and children) = Complexity.AC0Formula.and (Complexity.AC0Formula.restrictForest restriction children)
- Complexity.AC0Formula.restrict restriction (Complexity.AC0Formula.or children) = Complexity.AC0Formula.or (Complexity.AC0Formula.restrictForest restriction children)
Instances For
Apply a restriction to every formula in a forest.
Equations
- One or more equations did not get rendered due to their size.
- Complexity.AC0Formula.restrictForest restriction Complexity.AC0Forest.nil = Complexity.AC0Forest.nil
Instances For
Evaluation commutes with restricting an AC0 formula.
Conjunctive forest evaluation commutes with restriction.
Disjunctive forest evaluation commutes with restriction.
Restriction preserves total syntax-tree size exactly.
Restriction preserves total forest size exactly.
Restriction preserves connective depth exactly.
Restriction preserves maximum forest depth exactly.
Restriction removes exactly the variables it fixes.
Forest support is filtered to the free variables by restriction.