Manuscript OpenAI@2026-10-07 · OpenAI.tex · remark · 6a931f8f

Remark: Family 141. The existential theory of the reals and existential–universal sentences in the counting hierarchy

Family claims › Theoretical computer science · lines 1013–1018

OpenAI@2026-10-07#rem:oai-141

Back to manuscript

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.

The authors are OpenAI. This companion does not verify the proof. The claim is not a theorem of the Enter series and not a premise of any registered sheet. It does not close O.1. O.1 stays NOT_CLOSED. It is not a de Sitter state and not the QdS external-leg scheme. No quantum coefficient is admitted. No compilation is asserted.

Nearby in this section