Computability and Logic - Hardcover

Boolos, George S.; Burgess, John P.; Jeffrey, Richard C.

Hardcover

ISBN 10: 0521809754 ISBN 13: 9780521809757

Publisher: Cambridge University Press, 2002

Synopsis

Now in its fourth edition, this book has become a classic because of its accessibility to students without a mathematical background, and because it covers not only 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. John Burgess has enhanced the book by adding a selection of problems at the end of each chapter.

About this title

Book Description

Now in its fourth edition, this book has become a classic because of its accessibility to tudents 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. John Burgess has now enhanced the book by adding a selection of problems at the end of each chapter, and by reorganising and rewriting chapters to make them more independent of each other.

Review

"The writing style is excellent: although many explanations are formal, they are perfectly clear. Modern, elegant proofs help the reader understand the classic theorems and keep the book to a reasonable length." Computing Reviews

Edition details

• Publisher: Cambridge University Press
• Publication date: 2002
• Language: English
• ISBN 10: 0521809754
• ISBN 13: 9780521809757
• Binding: Hardcover
• Edition number: 4
• Number of pages: 368