The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems, and Computable Functions
David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Martin Davis (ed.)
Dover Publication (1965)
"A valuable collection both for original source material as well as historical formulations of current problems."-- The Review of Metaphysics "Much more than a mere collection of papers . . . a valuable addition to the literature."-- Mathematics of Computation An anthology of fundamental papers on undecidability and unsolvability by major figures in the field, this classic reference opens with Godel's landmark 1931 paper demonstrating that systems of logic cannot admit proofs of all true assertions of arithmetic. Subsequent papers by Godel, Church, Turing, and Post single out the class of recursive functions as computable by finite algorithms. Additional papers by Church, Turing, and Post cover unsolvable problems from the theory of abstract computing machines, mathematical logic, and algebra, and material by Kleene and Post includes initiation of the classification theory of unsolvable problems. Suitable for graduate and undergraduate courses. 1965 ed.
|Keywords||Gödel's theorem Unsolvability (Mathematical logic Recursive functions Turing machines Computable functions|
|Categories||categorize this paper)|
|Buy the book||$9.95 used (61% off) $12.66 new (50% off) $17.48 direct from Amazon (30% off) Amazon page|
|Call number||QA9.65.U53 2004|
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
Gualtiero Piccinini (2009). Computationalism in the Philosophy of Mind. Philosophy Compass 4 (3):515-532.
Stewart Shapiro (1980). On the Notion of Effectiveness. History and Philosophy of Logic 1 (1-2):209-230.
Stewart Shapiro (1983). Remarks on the Development of Computability. History and Philosophy of Logic 4 (1-2):203-220.
Gilbert Harman (1983). Internally Represented Grammars. Behavioral and Brain Sciences 6 (3):408.
Alessandra Carbone & Franco Montagna (1990). Much Shorter Proofs: A Bimodal Investigation. Mathematical Logic Quarterly 36 (1):47-66.
Similar books and articles
Alexandra Shlapentokh (2002). Generalized Weak Presentations. Journal of Symbolic Logic 67 (2):787-819.
Robert I. Soare (1996). Computability and Recursion. Bulletin of Symbolic Logic 2 (3):284-321.
Oron Shagrir (1997). Two Dogmas of Computationalism. Minds and Machines 7 (3):321-44.
Bruno Scarpellini (2003). Comments on `Two Undecidable Problems of Analysis'. Minds and Machines 13 (1):79-85.
Joseph S. Miller (2004). Degrees of Unsolvability of Continuous Functions. Journal of Symbolic Logic 69 (2):555 - 584.
Harry R. Lewis (1979). Unsolvable Classes of Quantificational Formulas. Addison-Wesley Pub. Co..
George Boolos, John Burgess, Richard P. & C. Jeffrey (2007). Computability and Logic. Cambridge University Press.
Nachum Dershowitz & Yuri Gurevich (2008). A Natural Axiomatization of Computability and Proof of Church's Thesis. Bulletin of Symbolic Logic 14 (3):299-350.
Added to index2009-01-28
Total downloads71 ( #19,335 of 1,098,791 )
Recent downloads (6 months)5 ( #57,338 of 1,098,791 )
How can I increase my downloads?