Skip to content
Register Sign in Wishlist
Metamathematics, Machines and Gödel's Proof

Metamathematics, Machines and Gödel's Proof

CAD$59.95 (C)

Part of Cambridge Tracts in Theoretical Computer Science

  • Date Published: March 1997
  • availability: Available
  • format: Paperback
  • isbn: 9780521585330

CAD$ 59.95 (C)
Paperback

Add to cart Add to wishlist

Other available formats:
eBook


Looking for an examination copy?

This title is not currently available for examination. However, 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
  • The automatic verification of large parts of mathematics has been an aim of many mathematicians from Leibniz to Hilbert. While Gödel's first incompleteness theorem showed that no computer program could automatically prove certain true theorems in mathematics, the advent of electronic computers and sophisticated software means in practice there are many quite effective systems for automated reasoning that can be used for checking mathematical proofs. This book describes the use of a computer program to check the proofs of several celebrated theorems in metamathematics including those of Gödel and Church-Rosser. The computer verification using the Boyer-Moore theorem prover yields precise and rigorous proofs of these difficult theorems. It also demonstrates the range and power of automated proof checking technology. The mechanization of metamathematics itself has important implications for automated reasoning, because metatheorems can be applied as labor-saving devices to simplify proof construction.

    • Only book of its kind
    • Clear presentation
    • Accessible to interested general readers
    Read more

    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

    • Date Published: March 1997
    • format: Paperback
    • isbn: 9780521585330
    • length: 220 pages
    • dimensions: 235 x 191 x 12 mm
    • weight: 0.39kg
    • contains: 4 b/w illus.
    • availability: Available
  • Table of Contents

    1. Introduction
    2. The statement of the incompleteness theorem
    3. Derived inference rules
    4. The representability of metatheory
    5. The undecidable sentence
    6. A mechanical proof of the Church–Rosser theorem
    7. Conclusions.

  • Author

    N. Shankar, SRI International, USA

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