The Dual of Quantifier Elimination: Boolean Elimination over C and R

Matthew Frank

We show that every finite Boolean combination of polynomial equalities and inequalities in C^n admits two uniform normal forms: an $\exists \forall$ form and a $\forall \exists$ form…