Metamathematics, Machines and Gödel's Proof
$42.00 ( ) USD
- Author: N. Shankar, SRI International, USA
Adobe eBook Reader
Other available formats:
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 email@example.com providing details of the course you are teaching.
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.Read more
- Only book of its kind
- Clear presentation
- Accessible to interested general readers
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: April 2011
- format: Adobe eBook Reader
- isbn: 9780511881381
- contains: 4 b/w illus.
- availability: This ISBN is for an eBook version which is distributed on our behalf by a third party.
Table of Contents
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
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email firstname.lastname@example.orgRegister Sign in
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 ×