Skip to content
Register Sign in Wishlist

Computability and Logic

4th Edition

$28.00 ( ) USD

  • 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

$ 28.00 USD ( )
Adobe eBook Reader

You will be taken to ebooks.com for this purchase
Buy eBook Add to wishlist

Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • Now in its fourth edition, this book has become a classic because of its accessibility to students without a mathematical background, and because it covers not only 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 enhanced the book by adding a selection of problems at the end of each chapter.

    • 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
    Read more

    Reviews & endorsements

    "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

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    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.

  • Authors

    George S. Boolos, Massachusetts Institute of Technology

    John P. Burgess, Princeton University, New Jersey

    Richard C. Jeffrey, Princeton University, New Jersey

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» 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 ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

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.

×
Please fill in the required fields in your feedback submission.
×