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. This 2007 fifth edition has been thoroughly revised by John Burgess. Including a selection of exercises, adjusted for this edition, at the end of each chapter, it offers a simpler treatment of the representability of recursive functions, a traditional stumbling block for students on the way to the Godel incompleteness theorems. This updated edition is also accompanied by a website as well as an instructor's manual.
- ISBN13 9780511804076
- Publish Date 5 June 2012 (first published 18 July 1974)
- Publish Status Active
- Publish Country GB
- Publisher Cambridge University Press
- Imprint Cambridge University Press (Virtual Publishing)
- Edition 5th Revised edition
- Format eBook
- Language English