Preview "Computability and Logic (5th ed.)" in a new window.

Book Description

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. This 2007 fifth edition has been thoroughly revised by John Burgess. Including a selection of exercises, adjusted for this edition, at the end of each chapter, it offers a simpler treatment of the representability of recursive functions, a traditional stumbling block for students on the way to the Godel incompleteness theorems. This updated edition is also accompanied by a website as well as an instructor's manual.


In The Press


About the Author


Read on Your Favourite Devices

to find out more



Ebook Permissions

to find out more

About this Ebook

File formats
This ebook is available in:
The publisher has not yet supplied format information.
Pre-order formats shown are based on publisher intent and may change before release.
File sizes shown are an approximation. The actual download size will vary based on the application you use to read the book.
Publisher
Published
; Copyright:
ISBNs
Title
Series
Author
;
Edition
Imprint
Language
Number of Pages
Page count shown is an approximation provided by the publisher. The actual page count will vary based on various factors such as your device's screen size and font-size.