HOME | BESTSELLERS | NEW RELEASES | PRICE WATCH | FICTION | BIOGRAPHIES | E-BOOKS |
Metamathematics, Machines and Gödel's Proof (Cambridge Tracts in Theoretical Computer Science) Book
* Excludes Voucher Code Discount Also available Used from £N/A
-
Product Description
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.
- 0521585333
- 9780521585330
- N. Shankar
- 30 January 1997
- Cambridge University Press
- Paperback (Book)
- 220
- Reprint
Would you like your name to appear with the review?
We will post your book review within a day or so as long as it meets our guidelines and terms and conditions. All reviews submitted become the licensed property of www.find-book.co.uk as written in our terms and conditions. None of your personal details will be passed on to any other third party.
All form fields are required.