Computability and logic Boolos, George

By:

Boolos, George

Contributor(s):

Burgess, John P

Material type: Text

TextPublication details: Cambridge, New York Cambridge University Press 2007 Edition: 5th edDescription: xiii, 350 pISBN:

9780521701464

Subject(s):

DDC classification:

511.352

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

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Call number	Status	Date due	Barcode	Item holds
Book	Ahmedabad	511.352 B6C6/2007 (Browse shelf(Opens below))	Available		164437

Total holds: 0

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.

There are no comments on this title.

to post a comment.