+612 9045 4394
Metamathematics, Machines and Goedel's Proof : Cambridge Tracts in Theoretical Computer Science (Paperback) - N. Shankar

Metamathematics, Machines and Goedel's Proof

Cambridge Tracts in Theoretical Computer Science (Paperback)

Paperback Published: 17th March 1997
ISBN: 9780521585330
Number Of Pages: 220

Share This Book:


RRP $65.95
Ships in 10 to 15 business days

The automatic verification of large parts of mathematics has been an aim of many mathematicians from Leibniz to Hilbert. While Godel'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 Godel 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.

The statement of the incompleteness theorem
Derived inference rules
The representability of metatheory
The undecidable sentence
A mechanical proof of the Church-Rosser theorem
Table of Contents provided by Publisher. All Rights Reserved.

ISBN: 9780521585330
ISBN-10: 0521585333
Series: Cambridge Tracts in Theoretical Computer Science (Paperback)
Audience: Professional
Format: Paperback
Language: English
Number Of Pages: 220
Published: 17th March 1997
Country of Publication: GB
Dimensions (cm): 23.22 x 19.3  x 1.32
Weight (kg): 0.39