Recursive functions and metamathematics. Problems of completeness and decidability, Gödel's theorems

zbMath0934.03001MaRDI QIDQ1125201

Roman Murawski

Publication date: 6 December 1999

Published in: Synthese Library (Search for Journal in Brave)

zbMATH Keywords

complexityChurch's thesisundecidabilitydecidabilityincompletenessrecursive functionsmodels of computationHilbert's programcomputation hierarchiesGödel theoremsphilosophical consequences

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Undecidability and degrees of sets of sentences (03D35) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Decidability of theories and sets of sentences (03B25) First-order arithmetic and fragments (03F30) History of mathematical logic and foundations (03-03) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10)

Related Items (4)

On proofs of the incompleteness theorems based on Berry's paradox by Vopěnka, Chaitin, and Boolos ⋮ Kalmár's Argument Against the Plausibility of Church's Thesis ⋮ CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS ⋮ FINDING THE LIMIT OF INCOMPLETENESS I

This page was built for publication: Recursive functions and metamathematics. Problems of completeness and decidability, Gödel's theorems