Metamathematics, Machines and Goedel's Proof (Paperback, Revised)

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.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Series:	Cambridge Tracts in Theoretical Computer Science
Release date:	1997
First published:	1994
Authors:	N. Shankar
Dimensions:	248 x 175 x 17mm (L x W x T)
Format:	Paperback - Trade
Pages:	220
Edition:	Revised
ISBN-13:	978-0-521-58533-0
Categories:	Books > Computing & IT > General theory of computing > Mathematical theory of computation Books > Science & Mathematics > Mathematics > Mathematical foundations > Mathematical logic Promotions
LSN:	0-521-58533-3
Barcode:	9780521585330

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!