Computability and Logic

(4 )

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. Including a selection of exercises, adjusted for th…

Shelves
Science Richard C. Jeffrey Philosophy Computer Science George S. Boolos Nonfiction John P. Burgess Logic Reference Computation Textbooks book Mathematics Programming