The incompleteness theorems after 70 years
From MaRDI portal
Publication:598275
DOI10.1016/j.apal.2003.10.012zbMath1053.03033OpenAlexW1992712548MaRDI QIDQ598275
Publication date: 6 August 2004
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2003.10.012
First-order arithmetic and fragments (03F30) Models of arithmetic and set theory (03C62) Proof theory in general (including proof-theoretic semantics) (03F03)
Related Items
On proofs of the incompleteness theorems based on Berry's paradox by Vopěnka, Chaitin, and Boolos, On constructivity and the Rosser property: a closer look at some Gödelean proofs, Gödel's incompleteness theorems. On the occasion of Kurt Gödel's 100th anniversary on April 28, 2006, AN INCOMPLETENESS THEOREM VIA ORDINAL ANALYSIS, INCOMPLETENESS VIA PARADOX AND COMPLETENESS, Provability logic: models within models in Peano arithmetic, The scope of Gödel's first incompleteness theorem, CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS, ON THE DIAGONAL LEMMA OF GÖDEL AND CARNAP, FINDING THE LIMIT OF INCOMPLETENESS I
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Undefinability of truth and nonstandard models
- Kolmogorov complexity and the second incompleteness theorem
- Existentially closed structures and Gödel's second incompleteness theorem
- More on induction in the language with a satisfaction class
- Arithmetization of metamathematics in a general setting
- Other Proofs of Old Results
- On Godel's Second Incompleteness Theorem
- A Note on Boolos' Proof of the Incompleteness Theorem
- On the incompleteness theorems
- An addition to Rosser's theorem
- On Languages Which are Based on Non-Standard Arithmetic
- A note on the Entscheidungsproblem
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On definable sets of positive integers
- Recursive Predicates and Quantifiers
