Unconditional theorems link EA consistency implications to interpretability; conjectures that without such implication, no polynomial-size proofs of bounded consistency exist for true extensions.
Chaitin,Information-theoretic limitations of formal systems, JACM21(1974), no
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Toward a Characterization of Simulation Between Arithmetic Theories
Unconditional theorems link EA consistency implications to interpretability; conjectures that without such implication, no polynomial-size proofs of bounded consistency exist for true extensions.