Computability and Logic
5th Edition
£86.99
- Authors:
- George S. Boolos
- John P. Burgess, Princeton University, New Jersey
- Richard C. Jeffrey
- Date Published: November 2007
- availability: Available
- format: Hardback
- isbn: 9780521877527
£
86.99
Hardback
Other available formats:
Paperback, eBook
Looking for an inspection copy?
This title is not currently available on inspection
-
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.
Read more- Written at a level which requires the reader to have no mathematical background
- Covers staple topics for intermediate logic courses, but offers a large number of optional topics not available in competing books
- Fifth edition has been corrected and features a simpler treatment of the representability of recursive functions
Reviews & endorsements
'… gives an excellent coverage of the fundamental theoretical results about logic involving computability, undecidability, axiomatization, definability, incompleteness, etc.' American Math Monthly
See more reviews'The writing style is excellent: Although many explanations are formal, they are perfectly clear. Modern, elegant proofs help the reader understand the classic theorems and keep the book to a reasonable length.' Computing Reviews
' … a valuable asset to those who want to enhance their knowledge and strengthen their ideas in the areas of artificial intelligence, philosophy, theory of computing, discrete structures, mathematical logic. It is also useful to teachers for improving their teaching style in these subjects.' Computer Engineering
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Edition: 5th Edition
- Date Published: November 2007
- format: Hardback
- isbn: 9780521877527
- length: 366 pages
- dimensions: 253 x 184 x 25 mm
- weight: 0.85kg
- availability: Available
Table of Contents
Part I. Computability Theory:
1. Enumerability
2. Diagonalization
3. Turing computability
4. Uncomputability
5. Abacus computability
6. Recursive functions
7. Recursive sets and relations
8. Equivalent definitions of computability
Part II. Basic Metalogic:
9. A precis of first-order logic: syntax
10. A precis of first-order logic: semantics
11. The undecidability of first-order logic
12. Models
13. The existence of models
14. Proofs and completeness
15. Arithmetization
16. Representability of recursive functions
17. Indefinability, undecidability, incompleteness
18. The unprovability of consistency
Part III. Further Topics:
19. Normal forms
20. The Craig interpolation theorem
21. Monadic and dyadic logic
22. Second-order logic
23. Arithmetical definability
24. Decidability of arithmetic without multiplication
25. Non-standard models
26. Ramsey's theorem
27. Modal logic and provability.-
Resources for
Computability and Logic
George S. Boolos, John P. Burgess, Richard C. Jeffrey
General Resources
Find resources associated with this title
Type Name Unlocked * Format Size Showing of
This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to lecturers whose faculty status has been verified. To gain access to locked resources, lecturers should sign in to or register for a Cambridge user account.
Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other lecturers may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.
Supplementary resources are subject to copyright. Lecturers are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.
If you are having problems accessing these resources please contact [email protected].
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email [email protected]
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×