Necessary and Sufficient Conditions for Undecidability of the Gödel Sentence and its Truth
DOI10.1007/978-94-007-0214-1_7zbMATH Open1259.03075OpenAlexW151227416MaRDI QIDQ2909753FDOQ2909753
Authors: Daniel Isaacson 
Publication date: 6 September 2012
Published in: The Western Ontario Series in Philosophy of Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-94-007-0214-1_7
Recommendations
- scientific article; zbMATH DE number 53543
- Gödel's incompleteness theorems
- scientific article; zbMATH DE number 1749189
- scientific article; zbMATH DE number 815055
- Unsatisfiable Formulae of Gödel Logic with Truth Constants and $$\varDelta $$ Are Recursively Enumerable
- Gödel's incompleteness theorem
- Gödel's third incompleteness theorem
- An implication of G\"odel's incompleteness theorem
- Gödel's completeness theorem
soundness\(\omega\)-consistency1-consistencyrecursively axiomatized theoryGödel's first incompleteness theoremGödel sentence
Decidability of theories and sets of sentences (03B25) Gödel numberings and issues of incompleteness (03F40)
Cited In (9)
- Current research on Gödel's incompleteness theorems
- Gödel's third incompleteness theorem
- Generalizations of Gödel's incompleteness theorems for \(\Sigma_n\)-definable theories of arithmetic
- On constructivity and the Rosser property: a closer look at some Gödelean proofs
- Unsatisfiable Formulae of Gödel Logic with Truth Constants and $$\varDelta $$ Are Recursively Enumerable
- The scope of Gödel's first incompleteness theorem
- A deflationary account of the truth of the Gödel sentence \(\mathcal{G}\)
- Gödel's second incompleteness theorem: how it is derived and what it delivers
- There may be many arithmetical Gödel sentences
This page was built for publication: Necessary and Sufficient Conditions for Undecidability of the Gödel Sentence and its Truth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2909753)
