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 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.

Author: George S. Boolos, John P. Burgess, Richard C. Jeffrey
Publisher: Cambridge University Press
Published: 09/01/2007
Pages: 366
Binding Type: Hardcover
Weight: 1.73lbs
Size: 9.95h x 7.25w x 0.98d
ISBN: 9780521877527

This title is not returnable