Graduate studies at Western
|Abstract||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)|
No categories specified
(categorize this paper)
|Through your library||Only published papers are available at libraries|
Similar books and articles
Dick Jongh, Marc Jumelet & Franco Montagna (1991). On the Proof of Solovay's Theorem. Studia Logica 50 (1):51 - 69.
William Tait (2001). Godel's Unpublished Papers on Foundations of Mathematics. Philosophia Mathematica 9 (1):87-126.
Paolo Gentilini (1999). Proof-Theoretic Modal PA-Completeness III: The Syntactic Proof. Studia Logica 63 (3):301-310.
Added to index2010-03-13
Total downloads15 ( #86,013 of 739,344 )
Recent downloads (6 months)1 ( #61,538 of 739,344 )
How can I increase my downloads?