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 Godels incompleteness theorems but also a large number of optional topics from Turings theory of computability to Ramseys theorem. Including a selection of exercises adjusted for this edition at the end of each chapter it offers a new and simpler treatment of the representability of recursive functions a traditional stumbling block for students on the way to the Godel incompleteness theorems.