N. Shankar. Checking the proof of Godel's incompleteness theorem. Technical Report, Institute for Computing Science, University of Texas at Austin, 1986.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....check the proof of a correct implementation of that specification at the machine code level. We chose the Boyer Moore logic for two reasons: first, our previous expertise in the logic, and second, the existence of the Boyer Moore theorem prover. Previous work with the Boyer Moore theorem prover [Shankar 86, Hunt 85] had demonstrated that it could be guided through very large and complex proofs. We attempted no comparison of Kit s specification in the Boyer Moore logic with a specification in a different language. One technical advantage in pushing operational specifications to an abstract level in ....

N. Shankar. Checking the proof of Godel's incompleteness theorem. Technical Report, Institute for Computing Science, University of Texas at Austin, 1986.

....principal of mathematical induction. The Boyer Moore system [BM79] has been motivated by and applied to large problems in program verification, but has also been applied to the interactive reconstruction of large proofs in mathematics and logic, such as the Godel Incompleteness theorem (Shankar [Sn85]) All of this work is relevant to program synthesis, yet it is difficult to find an existing system with all the features we need. We require the ability to prove theorems involving the quantifiers and connectives of first order logic and the mathematical induction principle. The Argonne systems, ....

N. Shankar, Checking the Proof of Godel's Incompleteness Theorem, Institute for Computing Science, University of Texas at Austin, 1985.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC