9780521809757 | 4 sub edition (Cambridge Univ Pr, August 1, 2002), cover price $99.99 |
About this edition: 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.
9780521380263 | 3 edition (Cambridge Univ Pr, September 29, 1989), cover price $64.95 |
About this edition: A text for a second course in logic for graduate and advanced undergraduate students.
9780521234795 | 1 edition (Cambridge Univ Pr, February 27, 1981), cover price $52.50 |
About this edition: 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.
9780521007580 | 4th edition (Cambridge Univ Pr, August 1, 2002), cover price $34.99 |
About this edition: 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.
9780521389235 | 3 edition (Cambridge Univ Pr, October 1, 1989), cover price $30.00 |
About this edition: A text for a second course in logic for graduate and advanced undergraduate students.
9780521299671 | 1 edition (Cambridge Univ Pr, February 27, 1981), cover price $18.95 |
About this edition: 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.