The Leading eBooks Store Online

for your Apple or Android device, Nook, Kobo, PC, Mac, Sony Reader...

New to eBooks.com?

Learn more
Computability and Logic
Add to cart
US$ 26.00 (+ tax)
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 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 new and simpler treatment of the representability of recursive functions, a traditional stumbling block for students on the way to the Godel incompleteness theorems. This new edition is also accompanied by a website as well as an instructor's manual.
Cambridge University Press; September 2007
366 pages; ISBN 9780511364297
Read online, or download in secure PDF format