Alphabeta MathSAT Tableaux and Quantified-Space Completeness: Examples
About this page
Pipeline-generated
How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
✓ 1 result · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.
1 · Prerequisites
Combinatorics
Computability Theory
- Effective Numberings, Reductions, Resources, and Randomness
- Formal Languages, Encodings, and Decision Problems
- Resource Bounds and Machine Invariance
- Robust Machine Models and Universal Computation
- SAT Tableaux and Quantified-Space Completeness
- Turing Machines, Configurations, and Computation
- Turing-Machine Configuration Boundary Interface
Real Analysis
2 · Logical flowchart
3 · Items
Example
A two-step computation tableau and its local clauses
Example
A Tseitin conversion preserves satisfiability
Example