David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
There is a familiar derivation of G¨ odel’s Theorem from the proof by diagonalization of the unsolvability of the Halting Problem. That proof, though, still involves a kind of self-referential trick, as we in effect construct a sentence that says ‘the algorithm searching for a proof of me doesn’t halt’. It is worth showing, then, that some core results in the theory of partial recursive functions directly entail G¨ odel’s First Incompleteness Theorem without any further self-referential trick.
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library||
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Paolo Gentilini (1999). Proof-Theoretic Modal PA-Completeness III: The Syntactic Proof. Studia Logica 63 (3):301-310.
William Tait (2001). Godel's Unpublished Papers on Foundations of Mathematics. Philosophia Mathematica 9 (1):87-126.
Dick Jongh, Marc Jumelet & Franco Montagna (1991). On the Proof of Solovay's Theorem. Studia Logica 50 (1):51 - 69.
Melvin Fitting (2008). A Quantified Logic of Evidence. Annals of Pure and Applied Logic 152 (1):67-83.
Haim Gaifman (2006). Naming and Diagonalization, From Cantor to Gödel to Kleene. Logic Journal of the Igpl 14 (5):709-728.
Added to index2010-03-13
Total downloads26 ( #104,520 of 1,699,581 )
Recent downloads (6 months)5 ( #128,702 of 1,699,581 )
How can I increase my downloads?