George S. Boolos,Richard C. Jeffrey,John P. Burgess
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 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.
Philosophy,Logic,Science,Mathematics,Philosophy,Science,Computer Science,Science,Nonfiction,Computer Science,Programming,Textbooks,Computer Science,Computers,Reference
Computability and Logic