The Surprise Examination Paradox and the Second Incompleteness Theorem

zbMath1261.03159arXiv1011.4974MaRDI QIDQ3010559

Ran Raz, Shira Kritchman

Publication date: 4 July 2011

Full work available at URL: https://arxiv.org/abs/1011.4974

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Gödel numberings and issues of incompleteness (03F40)

Related Items

Liar-type paradoxes and the incompleteness phenomena, On proofs of the incompleteness theorems based on Berry's paradox by Vopěnka, Chaitin, and Boolos, Approximating Kolmogorov complexity, Formalizing the unexpected hanging paradox: a classical surprise, INCOMPLETENESS VIA PARADOX AND COMPLETENESS, An axiomatic version of Fitch's paradox, Rosser-type undecidable sentences based on Yablo's paradox, Solovay functions and their applications in algorithmic randomness, Kolmogorov Complexity as a Language, CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS, ON THE DIAGONAL LEMMA OF GÖDEL AND CARNAP, Incompleteness and the halting problem, Randomness and Intractability in Kolmogorov Complexity