Computability and Logic
Published on 17. September 2007
978-1-107-08650-0 (ISBN)
Description
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.
More details
Other editions
Additional editions
George S. Boolos | John P. Burgess | Richard C. Jeffrey
Computability and Logic
Book
09/2007
5th Edition
Cambridge University Press
€134.50
Shipment within 15-20 days
