∑math20

Theoretical computer science · Result 141

Existential–universal real sentences in the counting hierarchy

1 paper

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.

Watch

▶Introduction: the problem and why it mattersin preparation
▶The presented solutionin preparation

Papers 1

First page of Existential–universal real sentences in the counting hierarchy

Existential–universal real sentences in the counting hierarchy

OpenAI · October 4, 2026

We prove that the existential theory of the reals lies in the counting hierarchy. More generally, we show that the truth of existential–universal sentences over the reals can be decided in a fixed level of the counting hierarchy, even when the integer polynomials are given by arithmetic circuits.

Read PDF Download Source

Cite
@misc{OAI:Existential-universal-real-sentences-in-the-counting-hierarchy-October-4-2026,
  author = {{OpenAI}},
  title = {{Existential--universal real sentences in the counting hierarchy}},
  howpublished = {OpenAI Math Release preprint
                  \href{https://github.com/openai/math/blob/main/preprints/Existential-universal-real-sentences-in-the-counting-hierarchy-October-4-2026/etr-counting-hierarchy.pdf}{OAI:Existential-universal-real-sentences-in-the-counting-hierarchy-October-4-2026}},
  year = {2026}
}

Formal verification

No Lean formalization is listed for this result yet. The repository notes that unformalized results could have issues.