Skip to main content Accessibility help
×
  1. Home
  2. Books
  3. Metamathematics, Machines and Gödel's Proof
  • Cited by 41
      • Show more authors
      • You may already have access via personal or institutional login
    • Select format
    • Publisher:
      Cambridge University Press
      Publication date:
      October 2009
      May 1994
      ISBN:
      9780511569883
      9780521585330
      DOI:
      https://doi.org/10.1017/CBO9780511569883
      Dimensions:
      Weight & Pages:
      Dimensions:
      (247 x 174 mm)
      Weight & Pages:
      0.413kg, 220 Pages
      • Subjects:
      Algorithmics, Complexity, Computer Algebra, Computational Geometry, Computer Science, Programming Languages and Applied Logic
      Series:
      Cambridge Tracts in Theoretical Computer Science (38)
    You may already have access via personal or institutional login
    • Selected: Digital
    Add to cart View cart Buy from Cambridge.org
    Subjects:
    Algorithmics, Complexity, Computer Algebra, Computational Geometry, Computer Science, Programming Languages and Applied Logic
    Series:
    Cambridge Tracts in Theoretical Computer Science (38)
    Information

    Book description

    Mathematicians from Leibniz to Hilbert have sought to mechanise the verification of mathematical proofs. Developments arising out of Gödel's proof of his incompleteness theorem showed that no computer program could automatically prove true all the theorems of mathematics. In practice, however, there are a number of sophisticated automated reasoning programs that are quite effective at checking mathematical proofs. Now in paperback, this book describes the use of a computer program to check the proofs of several celebrated theorems in metamathematics including Gödel's incompleteness theorem and the Church–Rosser theorem. 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 mechanisation of metamathematics itself has important implications for automated reasoning since metatheorems can be applied by labour-saving devices to simplify proof construction. The book should be accessible to scientists and philosophers with some knowledge of logic and computing.

    Refine List

    Actions for selected content:

    Select all | Deselect all
    • View selected items
    • Export citations
    • Download PDF (zip)
    • Save to Kindle
    • Save to Dropbox
    • Save to Google Drive

    Save Search

    You can save your searches here and later view and run them again in "My saved searches".

    Please provide a title, maximum of 40 characters.
    Cancel
    ×

    Contents

    Contents

    Metrics

    Altmetric attention score

    Full text views

    Total number of HTML views: 0
    Total number of PDF views: 0 *
    Loading metrics...

    Book summary page views

    Total views: 0 *
    Loading metrics...

    * Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

    Usage data cannot currently be displayed.

    Accessibility standard: Unknown

    Why this information is here

    This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

    Accessibility Information

    Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.