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. 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.
ASIN: 0521701465
VSKU: BVV.0521701465.G
Condition: Good
Author/Artist:Boolos, George S.|Burgess, John P.|Jeffrey, Richard C.
Binding: Paperback
Note: Any images shown are stock photographs and product may differ from what is shown.
Condition Notes: The item shows wear from consistent use, but it remains in good condition and works perfectly. All pages and cover are intact including the dust cover, if applicable . Spine may show signs of wear. Pages may include limited notes and highlighting. May NOT include discs, access code or other supplemental materials.
ASIN: 0521701465
VSKU: BVV.0521701465.G
Condition: Good
Author/Artist:Boolos, George S.|Burgess, John P.|Jeffrey, Richard C.
Binding: Paperback
Note: Any images shown are stock photographs and product may differ from what is shown.
Condition Notes: The item shows wear from consistent use, but it remains in good condition and works perfectly. All pages and cover are intact including the dust cover, if applicable . Spine may show signs of wear. Pages may include limited notes and highlighting. May NOT include discs, access code or other supplemental materials.