A theorem prover for a computational logic
- 1 January 1990
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- The Use of a Formal Simulator to Verify a Simple Real Time Control ProgramPublished by Springer Nature ,1990
- The addition of bounded quantification and partial functions to a computational logic and its theorem proverJournal of Automated Reasoning, 1988
- Mechanical Geometry Theorem ProvingPublished by Springer Nature ,1987
- A Mechanical Proof of the Unsolvability of the Halting ProblemJournal of the ACM, 1984
- Proof Checking The RSA Public Key Encryption AlgorithmThe American Mathematical Monthly, 1984
- A Mechanical Proof of the Turing Completeness of Pure LispContemporary Mathematics, 1984
- Proving Theorems about LISP FunctionsJournal of the ACM, 1975
- Computer proofs of limit theoremsArtificial Intelligence, 1972
- Splitting and reduction heuristics in automatic theorem provingArtificial Intelligence, 1971
- Proving Properties of Programs by Structural InductionThe Computer Journal, 1969