Metamathematics, Machines and Gdel's Proof by N. Shankar - 9780521585330

Metamathematics, Machines and Gdel's ProofAuthor(s): N. Shankar\nFormat: Paperback\nPublisher: Cambridge University Press, United Kingdom\nImprint: Cambridge University Press\nISBN-13: 9780521585330, 978-0521585330\nSynopsis\nMathematicians from Leibniz to Hilbert have sought to mechanise the verification of mathematical proofs. Developments arising out of Gdel'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 Gdel's incompleteness theorem and the ChurchRosser theorem. The computer verification using the BoyerMoore theorem prover yields precise and rigorous proofs of these difficult theorems. It also demonstrates.