On constructivity and the Rosser property: a closer look at some Gödelean proofs
From MaRDI portal
Publication:1653263
DOI10.1016/j.apal.2018.04.009zbMath1434.03135DBLPjournals/apal/SalehiS18arXiv1612.02549OpenAlexW2787237760WikidataQ57533018 ScholiaQ57533018MaRDI QIDQ1653263
Publication date: 17 July 2018
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.02549
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) First-order arithmetic and fragments (03F30) Gödel numberings and issues of incompleteness (03F40) Algorithmic randomness and dimension (03D32)
Related Items (3)
CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS ⋮ ON THE DIAGONAL LEMMA OF GÖDEL AND CARNAP ⋮ GÖDEL’S SECOND INCOMPLETENESS THEOREM: HOW IT IS DERIVED AND WHAT IT DELIVERS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The incompleteness theorems after 70 years
- On the scheme of induction for bounded arithmetic formulas
- On formalization of model-theoretic proofs of Gödel's theorems
- General recursive functions of natural numbers
- Undecidable theories
- Necessary and Sufficient Conditions for Undecidability of the Gödel Sentence and its Truth
- On proofs of the incompleteness theorems based on Berry's paradox by Vopěnka, Chaitin, and Boolos
- Gödel incompleteness theorems and the limits of their applicability. I
- Algorithmic information theory
- A Note on Boolos' Proof of the Incompleteness Theorem
- Boolos-style proofs of limitative theorems
- The shortest definition of a number in Peano arithmetic
- Interlude: About the First Theorem
- Gödel’s Incompleteness Phenomenon—Computationally
This page was built for publication: On constructivity and the Rosser property: a closer look at some Gödelean proofs