Theoretical computer science · Oct 6, 2026
Existential–universal real sentences in the counting hierarchy
Proves that the existential theory of the reals lies in the counting hierarchy. More generally, truth of existential–universal real sentences can be decided at one fixed level of that hierarchy, even when their integer polynomials are specified by arithmetic circuits.
Contributors
Unreleased OpenAI model
AI systems: Unreleased OpenAI model