Latest

Theoretical computer science

Existential–universal real sentences in the counting hierarchy

OpenAI research collection · 1 manuscript · Source checked 2026-10-19

OpenAI's result summary

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.

Read the manuscripts

Short excerpts below come from OpenAI's abstracts. The full abstract and original PDF preserve the paper's precise scope.

MANUSCRIPT 01

Existential–universal real sentences in the counting hierarchy

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.

This exact PDF is not listed in the imported formalization catalogue. Family scope notes may contain further information.

One signal in the wider AGI picture

New mathematical reasoning could help AI tackle harder scientific and computational problems. How reliably these skills transfer beyond mathematics will determine how much they contribute to general intelligence.

Explore the AGI Clock ↗