Logic, Logic & Foundations of Mathematics, Mathematical Series, Mathematics - General & Miscellaneous
Log in to track your reading progress.
Overview
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.
Editorials
From The Critics
This intermediate logic textbook for philosophy and computer science students introduces Gödel's completeness theorem, several incompleteness theorems, their attendant lemmas and corollaries, the theory of Turing machines, recursive functions, definability, and decidability. The fourth edition adds problems at the end of each chapter. Annotation c. Book News, Inc., Portland, OR (booknews.com)Book Details
Published
December 4, 1980
Publisher
Cambridge University Press
Pages
304
Format
Hardcover
ISBN
9780521234795