Computability and Logic

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 Godels Incompleteness Theorems, but also a large number of optional topics from Turings theory of computability to Ramseys theorem. John Burgess has enhanced the book by adding a selection of problems at the end of each chapter.