Cambridge University Press (2007)
Abstract |
Computability and Logic has become a classic because of its accessibility to students without a mathematical background and because it covers not simply the staple topics of an intermediate logic course, such as Godel’s incompleteness theorems, but also a large number of optional topics, from Turing’s theory of computability to Ramsey’s theorem. Including a selection of exercises, adjusted for this edition, at the end of each chapter, it offers a new and simpler treatment of the representability of recursive functions, a traditional stumbling block for students on the way to the Godel incompleteness theorems.
|
Keywords | Computable functions Recursive functions Logic, Symbolic and mathematical |
Categories | (categorize this paper) |
Buy this book | $96.62 new (3% off) Amazon page |
Call number | QA9.59.B66 2007 |
ISBN(s) | 0521809754 9780521877527 0521877520 |
Options |
![]() ![]() ![]() ![]() |
Download options
References found in this work BETA
No references found.
Citations of this work BETA
Emergence, Reduction and Supervenience: A Varied Landscape. [REVIEW]Jeremy Butterfield - 2011 - Foundations of Physics 41 (6):920-959.
Against Logicist Cognitive Science.Mike Oaksford & Nick Chater - 1991 - Mind and Language 6 (1):1-38.
Everything You Always Wanted to Know About Structural Realism but Were Afraid to Ask.Roman Frigg & Ioannis Votsis - 2011 - European Journal for Philosophy of Science 1 (2):227-276.
The Logic and Meaning of Plurals. Part I.Byeong-Uk Yi - 2005 - Journal of Philosophical Logic 34 (5-6):459-506.
Logicism, Mental Models and Everyday Reasoning: Reply to Garnham.Nick Chater & Mike Oaksford - 1993 - Mind and Language 8 (1):72-89.
View all 90 citations / Add more citations
Similar books and articles
Computability, an Introduction to Recursive Function Theory.Nigel Cutland - 1980 - Cambridge University Press.
Review: Richard L. Epstein, Walter A. Carnielli, Computability. Computable Functions, Logic, and the Foundations of Mathematics ; Richard L. Epstein, Walter A. Carnielli, Computability. Computable Functions, Logic, and the Foundations of Mathematics. Second Edition of the Preceding. [REVIEW]Carlos Augusto Priscdio - 2002 - Bulletin of Symbolic Logic 8 (1):101-104.
The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems, and Computable Functions.Martin Davis (ed.) - 1965 - Dover Publication.
A Natural Axiomatization of Computability and Proof of Church’s Thesis.Nachum Dershowitz & Yuri Gurevich - 2008 - Bulletin of Symbolic Logic 14 (3):299-350.
Analytics
Added to PP index
2009-01-28
Total views
147 ( #64,750 of 2,403,591 )
Recent downloads (6 months)
4 ( #197,288 of 2,403,591 )
2009-01-28
Total views
147 ( #64,750 of 2,403,591 )
Recent downloads (6 months)
4 ( #197,288 of 2,403,591 )
How can I increase my downloads?
Downloads