'Intended for a second course in logic it gives excellent coverage of the fundamental theoretical results about logic involving computability, undecidability, axiomatization, definability, incompleteness, etc.' American Math Monthly
'... particularly appropriate for graduate and advanced undergraduate students in philosophy ... The book is written in a clear and pleasing style and avoids pedantry ... It should be an excellent text for its intended audience.' Mathematical Reviews
Now in its fourth edition, this book has become a classic because of its accessibility to tudents 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. John Burgess has now enhanced the book by adding a selection of problems at the end of each chapter, and by reorganising and rewriting chapters to make them more independent of each other.
--This text refers to an out of print or unavailable edition of this title.