Cambridge University Press 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, but also a large number of optional topics, from TuringâEUR(TM)s theory of computability to RamseyâEUR(TM)s theorem.