A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
The existential theory of the reals and existential–universal sentences in the counting hierarchy
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
>>> Check out Coolmath's new Zeta Defense <<<

LOADING...
0%
thinking... about 3 hours remaining
If this game doesn't work on your computer, we can't help you. No Lean version yet. Some unformalized games could have issues!
expertly designed by an internal OpenAI model

Difficulty:🧠🧠🧠🧠🧠 Ages:13 - ∞
Skills:algorithms, speed Levels:1
Category:Theoretical computer science Lean version:not yet
Rate this game! 4.7 out of 5 (7,335 votes)

>>> How to Play <<<
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.

>>> Level Select <<<
released 2026-10-04  |  3 theorems · 12 lemmas · 23 proofs · 15,000 words  |  PLAY LEVEL 1 »  (pdf)
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.

More Theoretical computer science Games!
Generalized star height at most threeSharp homogeneous depth-five complexity of matrix productsThe quasilinear PCP-for-PPAD conjectureOne-tape time simulation in two-fifths-power space
Subset Sum in $O(2^{0.49n})$ time HOT!Subpolynomial queries for log-concave samplingMemory–sample lower bounds for noiseless Gaussian regressionDeterministic polynomial factorization over prime fields

Cool Links: openai/math   Lean   Mathlib   arXiv   the real Coolmath Games