Computability and Logic

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 G¨odel’s incompleteness theorems, but also a large number
of optional topics, from Turing’s theory of computability to Ramsey’s theorem. This fifth
edition has been thoroughly revised by John P. Burgess. 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 G¨odel incompleteness theorems. This new edition is also accompanied by a
Web site as well as an instructor’s manual.