Cambridge University Press (2007)
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 the book||$4.99 new (96% off) $8.97 used (92% off) $61.36 direct from Amazon (48% off) Amazon page|
|Call number||QA9.59.B66 2007|
|ISBN(s)||0521809754 9780521877527 0521877520|
References found in this work BETA
No references found.
Citations of this work BETA
Against Logicist Cognitive Science.Mike Oaksford & Nick Chater - 1991 - Mind and Language 6 (1):1-38.
Emergence, Reduction and Supervenience: A Varied Landscape. [REVIEW]J. Butterfield - 2011 - Foundations of Physics 41 (6):920-959.
Structuralism and the Identity of Indiscernibles.Jeffrey Ketland - 2006 - Analysis 66 (292):303–315.
The Logic and Meaning of Plurals. Part I.Byeong-Uk Yi - 2005 - Journal of Philosophical Logic 34 (5-6):459-506.
Inconsistency Theories of Semantic Paradox.Douglas Patterson - 2009 - Philosophy and Phenomenological Research 79 (2):387 - 422.
Similar books and articles
Theory of Recursive Functions and Effective Computability.H. Rogers - 1987 - MIT Press.
A Natural Axiomatization of Computability and Proof of Church's Thesis.Nachum Dershowitz & Yuri Gurevich - 2008 - Bulletin of Symbolic Logic 14 (3):299-350.
The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems, and Computable Functions.Martin Davis (ed.) - 1965 - Dover Publication.
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.
Computability, an Introduction to Recursive Function Theory.Nigel Cutland - 1980 - Cambridge University Press.
Added to index2009-01-28
Total downloads109 ( #45,488 of 2,169,103 )
Recent downloads (6 months)5 ( #60,980 of 2,169,103 )
How can I increase my downloads?