Computability and Logic

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

ISBN 10: 0521701465 / ISBN 13: 9780521701464

Published by Cambridge University Press, GB, 2007

About this Item

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.

Seller Inventory # LU-9780521701464

Bibliographic Details

• Title: Computability and Logic
• Publisher: Cambridge University Press, GB
• Publication Date: 2007
• Language: English
• ISBN 10: 0521701465
• ISBN 13: 9780521701464
• Binding: Paperback
• Edition: 5th or later Edition
• Condition: New
• Weight: 650 grams

About this title

Synopsis

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.

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