| Computability and Logic Contributor(s): Boolos, George S. (Author), Burgess, John P. (Author), Jeffrey, Richard C. (Author) |
|
 |
ISBN: 0521877520 ISBN-13: 9780521877527 Publisher: Cambridge University Press OUR PRICE: $118.75 Product Type: Hardcover - Other Formats Published: September 2007 Annotation: 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. |
| Additional Information |
| BISAC Categories: - Mathematics | Logic - Philosophy | Logic |
| Dewey: 511.352 |
| LCCN: 2007014225 |
| Physical Information: 0.98" H x 7.25" W x 9.95" (1.73 lbs) 366 pages |
| Descriptions, Reviews, Etc. |
| Publisher 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. |