The Dual of Quantifier Elimination: Boolean Elimination over C and R
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866918260140670976 |
|---|---|
| author | Frank, Matthew |
| author_facet | Frank, Matthew |
| contents | 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, each using a single polynomial equation. Both forms use only one existentially quantified variable and one universally quantified variable. Optimality results demonstrate that no purely existential or universal normal form is possible over C.
These results extend to sets constructible from entire functions, and to quantifier-free formulas in functional languages over infinite fields of characteristic 0. A corollary shows Zilber's conjecture on quasiminimality equivalent to its subcase quantifying a single equation.
Over R and Q, similar results hold, including a singly-quantified $\exists$ form for Boolean combinations of equations and inequations, an $\exists$ form for R established by prior methods, and other results for order inequalities parallel to the forms over C.
These results provide a dual to classical quantifier elimination: instead of removing quantifiers at the cost of increased Boolean complexity, they remove Boolean structure at the cost of a short, fixed quantifier prefix. The constructions have linear degree bounds and are explicit. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_20743 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The Dual of Quantifier Elimination: Boolean Elimination over C and R Frank, Matthew Logic Logic in Computer Science 03C10 (Primary), 03C60, 14P10, 14Q20 (Secondary) 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, each using a single polynomial equation. Both forms use only one existentially quantified variable and one universally quantified variable. Optimality results demonstrate that no purely existential or universal normal form is possible over C. These results extend to sets constructible from entire functions, and to quantifier-free formulas in functional languages over infinite fields of characteristic 0. A corollary shows Zilber's conjecture on quasiminimality equivalent to its subcase quantifying a single equation. Over R and Q, similar results hold, including a singly-quantified $\exists$ form for Boolean combinations of equations and inequations, an $\exists$ form for R established by prior methods, and other results for order inequalities parallel to the forms over C. These results provide a dual to classical quantifier elimination: instead of removing quantifiers at the cost of increased Boolean complexity, they remove Boolean structure at the cost of a short, fixed quantifier prefix. The constructions have linear degree bounds and are explicit. |
| title | The Dual of Quantifier Elimination: Boolean Elimination over C and R |
| topic | Logic Logic in Computer Science 03C10 (Primary), 03C60, 14P10, 14Q20 (Secondary) |
| url | https://arxiv.org/abs/2511.20743 |