David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Oxford University Press (1992)
Kurt Godel, the greatest logician of our time, startled the world of mathematics in 1931 with his Theorem of Undecidability, which showed that some statements in mathematics are inherently "undecidable." His work on the completeness of logic, the incompleteness of number theory, and the consistency of the axiom of choice and the continuum theory brought him further worldwide fame. In this introductory volume, Raymond Smullyan, himself a well-known logician, guides the reader through the fascinating world of Godel's incompleteness theorems. The level of presentation is suitable for anyone with a basic acquaintance with mathematical logic. As a clear, concise introduction to a difficult but essential subject, the book will appeal to mathematicians, philosophers, and computer scientists.
|Categories||categorize this paper)|
|Buy the book||$70.00 used (69% off) $92.51 new (59% off) $197.79 direct from Amazon (13% off) Amazon page|
|Call number||QA9.65.S69 1992|
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
Joshua M. Epstein (1999). Agent-Based Computational Models and Generative Social Science. Complexity 4 (5):41-60.
Martin Pleitz (2010). Curves in G�Del-Space: Towards a Structuralist Ontology of Mathematical Signs. Studia Logica 96 (2):193-218.
Robert M. Solovay, R. D. Arthan & John Harrison (2012). Some New Results on Decidability for Elementary Algebra and Geometry. Annals of Pure and Applied Logic 163 (12):1765-1802.
Similar books and articles
Carlo Cellucci (1993). From Closed to Open Systems. In J. Czermak (ed.), Philosophy of Mathematics, pp. 206-220. Hölder-Pichler-Tempsky.
Raymond M. Smullyan (1993). Recursion Theory for Metamathematics. Oxford University Press.
Roman Murawski (1997). Gödel's Incompleteness Theorems and Computer Science. Foundations of Science 2 (1):123-135.
Zofia Adamowicz & Teresa Bigorajska (2001). Existentially Closed Structures and Gödel's Second Incompleteness Theorem. Journal of Symbolic Logic 66 (1):349-356.
Peter Smith (2013). An Introduction to Gödel's Theorems. Cambridge University Press.
N. Shankar (1994). Metamathematics, Machines, and Gödel's Proof. Cambridge University Press.
Panu Raatikainen (2005). On the Philosophical Relevance of Gödel's Incompleteness Theorems. Revue Internationale de Philosophie 59 (4):513-534.
Added to index2009-01-28
Total downloads96 ( #13,602 of 1,101,890 )
Recent downloads (6 months)17 ( #12,884 of 1,101,890 )
How can I increase my downloads?