Computability and Logic - Paperback
by George Boolos (Author), John P. Burgess (Author), Richard C. Jeffrey (Author)
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.
Made with care and unconditionally loved by our customers, this signature bestseller exceeds all expectations.
Made with care and unconditionally loved by our customers, this signature bestseller exceeds all expectations.
At the heart of every product lies a unique story, driven by our passion for quality and innovation. Each item enhances your everyday life and sparks joy.
