Synthese 13 (June):105-10 (1961)
|Abstract||This article has no associated abstract. (fix it)|
|Keywords||Computability Incompleteness Logic Proof Turing Machines Undecidability|
|Through your library||Configure|
Similar books and articles
Gualtiero Piccinini (2003). Alan Turing and the Mathematical Objection. Minds and Machines 13 (1):23-48.
N. Shankar (1994). Metamathematics, Machines, and Gödel's Proof. Cambridge University Press.
Karen Crawley, Limited Ink : Interpreting and Misinterpreting GÜdel's Incompleteness Theorem in Legal Theory.
Nachum Dershowitz & Yuri Gurevich (2008). A Natural Axiomatization of Computability and Proof of Church's Thesis. Bulletin of Symbolic Logic 14 (3):299-350.
Zofia Adamowicz & Teresa Bigorajska (2001). Existentially Closed Structures and Gödel's Second Incompleteness Theorem. Journal of Symbolic Logic 66 (1):349-356.
George Boolos (2007). Computability and Logic. Cambridge University Press.
Saul A. Kripke (forthcoming). Another Approach: The Church-Turing ‘Thesis’ as a Special Corollary of Gödel’s Completeness Theorem. In B. J. Copeland, C. Posy & O. Shagrir (eds.), Computability: Gödel, Turing, Church, and beyond. MIT Press.
Raymond M. Smullyan (1992). Gödel's Incompleteness Theorems. Oxford University Press.
Added to index2009-01-28
Total downloads25 ( #49,656 of 549,628 )
Recent downloads (6 months)2 ( #37,418 of 549,628 )
How can I increase my downloads?