Computability and Logic

Jeffrey R. C., Burgess J.978-0-511-07806-4, 0-511-07806-4, 978-0-521-80975-7, 0-521-80975-4, 978-0-521-00758-0, 0-521-00758-5

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.