02696nam a22004098i 4500001003300000003000700033005001700040006001900057007001500076008004100091020002600132020002900158020003000187040002900217050002200246082002200268099002000290100002600310245006500336246004800401264005200449300006300501336002700564337002700591338003700618490006000655500007300715520113400788650003901922650003101961730003001992776003602022830006002058856008902118907003502207998004402242ocm00000001camebacr9780511569883UkCbUP20151005020622.0m|||||o||d||||||||cr||||||||||||090520s1994||||enk o ||1 0|eng|d a9780511569883 (ebook) z9780521420273 (hardback) z9780521585330 (paperback) aUkCbUPbengerdacUkCbUP00aQA9.65b.S53 199400a511.3/0285/53220 aElectronic book1 aShankar, N.,eauthor.10aMetamathematics, machines, and Gödel's proof /cN. Shankar.3 aMetamathematics, Machines & Gödel's Proof. 1aCambridge :bCambridge University Press,c1994. a1 online resource (xv, 202 pages) :bdigital, PDF file(s). atextbtxt2rdacontent. acomputerbc2rdamedia. aonline resourcebcr2rdacarrier.1 aCambridge tracts in theoretical computer science ;v38. aTitle from publisher's bibliographic system (viewed on 05 Oct 2015). aMathematicians 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. 0aGödel's theoremxData processing. 0aAutomatic theorem proving.0 aCambridge EBA Collection.08iPrint version: z9780521420273. 0aCambridge tracts in theoretical computer science ;v38.40uhttps://ezproxy.mtsu.edu/login?url=https://doi.org/10.1017/CBO9780511569883zCONNECT a.b39020848b08-25-20c03-18-19 awib08-25-20cmdz e-fenggenkh0i2