Metamathematics, machines, and Gödel's proof / N. Shankar.

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,...

Full description

Bibliographic Details
Main Author: Shankar, N., (Author)
Format: Book
Language:English
Published: Cambridge : Cambridge University Press, 1994.
Series:Cambridge tracts in theoretical computer science ; 38.
Subjects:
Online Access:CONNECT
LEADER 02696nam a22004098i 4500
001 ocm00000001camebacr9780511569883
003 UkCbUP
005 20151005020622.0
006 m|||||o||d||||||||
007 cr||||||||||||
008 090520s1994||||enk o ||1 0|eng|d
020 |a 9780511569883 (ebook) 
020 |z 9780521420273 (hardback) 
020 |z 9780521585330 (paperback) 
040 |a UkCbUP  |b eng  |e rda  |c UkCbUP 
050 0 0 |a QA9.65  |b .S53 1994 
082 0 0 |a 511.3/0285/53  |2 20 
099 |a Electronic book 
100 1 |a Shankar, N.,  |e author. 
245 1 0 |a Metamathematics, machines, and Gödel's proof /  |c N. Shankar. 
246 3 |a Metamathematics, Machines & Gödel's Proof. 
264 1 |a Cambridge :  |b Cambridge University Press,  |c 1994. 
300 |a 1 online resource (xv, 202 pages) :  |b digital, PDF file(s). 
336 |a text  |b txt  |2 rdacontent. 
337 |a computer  |b c  |2 rdamedia. 
338 |a online resource  |b cr  |2 rdacarrier. 
490 1 |a Cambridge tracts in theoretical computer science ;  |v 38. 
500 |a Title from publisher's bibliographic system (viewed on 05 Oct 2015). 
520 |a 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. 
650 0 |a Gödel's theorem  |x Data processing. 
650 0 |a Automatic theorem proving. 
730 0 |a Cambridge EBA Collection. 
776 0 8 |i Print version:   |z 9780521420273. 
830 0 |a Cambridge tracts in theoretical computer science ;  |v 38. 
856 4 0 |u https://ezproxy.mtsu.edu/login?url=https://doi.org/10.1017/CBO9780511569883  |z CONNECT 
907 |a .b39020848  |b 08-25-20  |c 03-18-19 
998 |a wi  |b 08-25-20  |c m  |d z   |e -  |f eng  |g enk  |h 0  |i 2