Limited Time SaleUS$11.44 cheaper than the new price!!
| Management number | 231815856 | Release Date | 2026/06/18 | List Price | US$7.62 | Model Number | 231815856 | ||
|---|---|---|---|---|---|---|---|---|---|
| Category | |||||||||
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 2007 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 simpler treatment of the representability of recursive functions, a traditional stumbling block for students on the way to the Godel incompleteness theorems. This updated edition is also accompanied by a website as well as an instructor's manual. Read more
| ASIN | B00DO1HG40 |
|---|---|
| XRay | Not Enabled |
| ISBN13 | 978-0511450068 |
| Edition | 5th |
| Language | English |
| File size | 10.8 MB |
| Page Flip | Enabled |
| Publisher | Cambridge University Press |
| Word Wise | Enabled |
| Print length | 365 pages |
| Accessibility | Learn more |
| Screen Reader | Supported |
| Publication date | September 17, 2007 |
| Enhanced typesetting | Enabled |
If you notice any omissions or errors in the product information on this page, please use the correction request form below.
Correction Request Form