Author: Boolos, George S.

Price: $23.27

Category:Pure Mathematics
Publication Date:2007-09-17T00:00:01Z
Pages:366
Binding:Paperback
ISBN:10:0521701465
ISBN:13:9780521701464
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.