Computability and Logic
4th Edition
$34.99 USD
- Authors:
- George S. Boolos, Massachusetts Institute of Technology
- John P. Burgess, Princeton University, New Jersey
- Richard C. Jeffrey, Princeton University, New Jersey
- Date Published: February 2005
- availability: This ISBN is for an eBook version which is distributed on our behalf by a third party.
- format: Adobe eBook Reader
- isbn: 9780511074950
Find out more about Cambridge eBooks
$
34.99 USD
Adobe eBook Reader
Looking for an inspection copy?
This title is not currently available on inspection
-
This fourth edition of one of the classic logic textbooks has been thoroughly revised by John Burgess. The aim is to increase the pedagogical value of the book for the core market of students of philosophy and for students of mathematics and computer science as well. This book 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. John Burgess has now enhanced the book by adding a selection of problems at the end of each chapter, and by reorganising and rewriting chapters to make them more independent of each other and thus to increase the range of options available to instructors as to what to cover and what to defer.
Read more- More accessible than competitors (i.e. does not require mathematical background)
- Covers staple topics for intermediate logic courses, but offers a large number of optional topics not available in competing books
- Fourth edition has been reorganized to be easier to teach from. Now includes selections of problems at the end of each chapter
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: 4th Edition
- Date Published: February 2005
- format: Adobe eBook Reader
- isbn: 9780511074950
- contains: 55 b/w illus.
- availability: This ISBN is for an eBook version which is distributed on our behalf by a third party.
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
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.
Related Books
also by this author
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.
×