menu

Computability and Logic
by George S. Boolos and John P. Burgess and Richard C. Jeffrey




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

  Read Full Product Description
 
local_shippingFor Delivery
In Stock.
This item is Non-Returnable.
FREE Shipping for Club Members help
 
storeBuy Online Pickup At Store
search store by zipcode

 
 
New & Used Marketplace 7 copies from $93.80
 
 
 
 

More About Computability and Logic by George S. Boolos; John P. Burgess; Richard C. Jeffrey

 
 
 

Overview

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.


This item is Non-Returnable.

 

Details

  • ISBN-13: 9780521877527
  • ISBN-10: 0521877520
  • Publisher: Cambridge University Press
  • Publish Date: September 2007
  • Page Count: 350
  • Dimensions: 9.95 x 7.25 x 0.98 inches
  • Shipping Weight: 1.73 pounds


Related Categories

 

BAM Customer Reviews