Computability and Logic

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 revis...