Computability and logic, fifth edition

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

Research output: Book/ReportBook

152 Scopus citations

Abstract

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.

Original languageEnglish (US)
PublisherCambridge University Press
Number of pages350
ISBN (Electronic)9780511804076
ISBN (Print)9780521877527
DOIs
StatePublished - Jan 1 2007

All Science Journal Classification (ASJC) codes

  • General Arts and Humanities

Fingerprint

Dive into the research topics of 'Computability and logic, fifth edition'. Together they form a unique fingerprint.

Cite this