On proofs of the incompleteness theorems based on Berry's paradox by Vopěnka, Chaitin, and Boolos
From MaRDI portal
Publication:2910986
DOI10.1002/malq.201110067zbMath1257.03088MaRDI QIDQ2910986
Hiroshi Sakai, Taishi Kurahashi, Makoto Kikuchi
Publication date: 12 September 2012
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.201110067
03A05: Philosophical and critical aspects of logic and foundations
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
03F30: First-order arithmetic and fragments
03F40: Gödel numberings and issues of incompleteness
Related Items
CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS, GÖDEL’S SECOND INCOMPLETENESS THEOREM: HOW IT IS DERIVED AND WHAT IT DELIVERS, KURT GÖDEL ON LOGICAL, THEOLOGICAL, AND PHYSICAL ANTINOMIES, INCOMPLETENESS VIA PARADOX AND COMPLETENESS, Liar-type paradoxes and the incompleteness phenomena, Rosser-type undecidable sentences based on Yablo's paradox, On constructivity and the Rosser property: a closer look at some Gödelean proofs, ON THE DIAGONAL LEMMA OF GÖDEL AND CARNAP
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The incompleteness theorems after 70 years
- Recursive functions and metamathematics. Problems of completeness and decidability, Gödel's theorems
- Classical recursion theory. The theory of functions and sets of natural numbers
- The Berry paradox
- Kolmogorov complexity and the second incompleteness theorem
- On formalization of model-theoretic proofs of Gödel's theorems
- The Surprise Examination Paradox and the Second Incompleteness Theorem
- A Note on Boolos' Proof of the Incompleteness Theorem
- On the incompleteness theorems
- Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
- On Models Constructed by Means of the Arithmetized Completeness Theorem
- Information-theoretic computation complexity
- The shortest definition of a number in Peano arithmetic
- A survey of proof theory