Copyright ©1998-2010 Glenn Fleishman. Send in your comments. Bibliographic information on isbn.nu licensed from Baker & Taylor. Contact them for corrections and licensing, or read more about our data.
Computability and Logic
Descriptions of each edition are found in brief where available. Click details & prices to get more information on a book or to find the best prices for the title.
Hardcover
With John P. Burgess |
4 sub edition from Cambridge Univ Pr (August 1, 2002)
9780521809757 | details & prices | 356 pages | 7.00 × 10.25 × 1.00 in. | 1.75 lbs | List price $99.99
About: Now in its fourth edition, this book has become a classic because of its accessibility to students without a mathematical background, and because it covers not only 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.
About: Now in its fourth edition, this book has become a classic because of its accessibility to students without a mathematical background, and because it covers not only 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.
3 edition from Cambridge Univ Pr (September 29, 1989)
9780521380263 | details & prices | 314 pages | List price $64.95
About: A text for a second course in logic for graduate and advanced undergraduate students.
About: A text for a second course in logic for graduate and advanced undergraduate students.
1 edition from Cambridge Univ Pr (February 27, 1981)
9780521234795 | details & prices | 304 pages | List price $52.50
About: Now in its fourth edition, this book has become a classic because of its accessibility to students without a mathematical background, and because it covers not only 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.
About: Now in its fourth edition, this book has become a classic because of its accessibility to students without a mathematical background, and because it covers not only 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.
Paperback
With John P. Burgess |
4th edition from Cambridge Univ Pr (August 1, 2002)
9780521007580 | details & prices | 356 pages | 6.75 × 9.50 × 0.75 in. | 1.40 lbs | List price $34.99
About: Now in its fourth edition, this book has become a classic because of its accessibility to students without a mathematical background, and because it covers not only 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.
About: Now in its fourth edition, this book has become a classic because of its accessibility to students without a mathematical background, and because it covers not only 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.
3 edition from Cambridge Univ Pr (October 1, 1989)
9780521389235 | details & prices | 6.25 × 9.00 × 0.75 in. | 0.95 lbs | List price $30.00
About: A text for a second course in logic for graduate and advanced undergraduate students.
About: A text for a second course in logic for graduate and advanced undergraduate students.
1 edition from Cambridge Univ Pr (February 27, 1981)
9780521299671 | details & prices | 304 pages | List price $18.95
About: Now in its fourth edition, this book has become a classic because of its accessibility to students without a mathematical background, and because it covers not only 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.
About: Now in its fourth edition, this book has become a classic because of its accessibility to students without a mathematical background, and because it covers not only 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.