This book, first published in 1994, is derived from the author's 1986 Ph.D dissertation, one of the main goals of which was to gauge the usefulness of automatic theorem proving technology in constructing and verifying proofs. The proofs chosen for this task were Gödel's first incompleteness theorem and the Church-Rosser theorem of the lambda calculus. The theorem prover used was the Boyer-Moore theorem prover which can be obtained by ftp 1. A manual for the prover has been published as 2. The author gives a detailed account of the more important steps leading to the mechanized verification of proofs of these theorems. The theorem prover did not discover the proofs but checked definitions and lemmas (about 2000 for the incompleteness theorem and supplied by the author) that lead to the theorems.
/lp/association-for-computing-machinery/review-of-metamathematics-machines-and-g-dels-proof-by-n-shankar-aVlMPX8bA6