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
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
- remark: Remark: Family 102. The Unique Games Conjecture and optimal approximation thresholds
- remark: Remark: Family 103. Derandomization of logarithmic space: L= (RL)= (BPL)
- remark: Remark: Family 104. Quasipolynomial algorithms for mean-payoff, stochastic and parity games
- remark: Remark: Family 105. The 2-to-1 Games Conjecture with perfect completeness
- remark: Remark: Family 106. Hardness of coloring three-colorable graphs
- remark: Remark: Family 107. Matrix multiplication with exponent at most 9/4
- remark: Remark: Family 108. A cubic permanent–determinant lower bound
- remark: Remark: Family 109. Integer multiplication below n n