Abstract
We describe an implementation of an extension to the Boyer-Moore Theorem Prover and logic that allows first-order quantification. The extension retains the capabilities of the Boyer-Moore system while allowing the increased flexibility in specification and proof that is provided by quantifiers. The idea is to Skolemize in an appropriate manner. We demonstrate the power of this approach by describing three successful proof-checking experiments using the system, each of which involves a theorem of set theory as translated into a first-order logic. We also demonstrate the soundness of our approach.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
BoyerR. S. and MooreJ S., A Computational Logic Handbook, Academic Press, Boston (1988).
Goldschlag David M., ‘Mechanically verifying concurrent programs with the Boyer-Moore prover’, IEEE Transactions on Software Engineering, SE-16(9) (September 1990).
Goldschlag, David M., ‘Proving proof rules: A proof system for concurrent programs’, Compass '90 (June 1990).
Goldschlag, David M., ‘Mechanizing Unity’, in: Proceedings of the IFIP TC2 Working Conference on Programming Concepts and Methods, M. Broy and C. B. Jones (Eds.), Elsevier Science Publishers B.V. (1990).
Yu Yuan, ‘Computer proofs in group theory’, J. Automated Reasoning, 6(3) (September 1990).
Kaufmann, Matt, ‘A user's manual for an interactive enhancement to the Boyer-Moore Theorem Prover’, Tech. Report 19, Computational Logic, Inc. (May 1988).
Kaufmann, Matt, ‘Addition of free variables to an interactive enhancement of the Boyer-Moore Theorem Prover’, Tech. Report 42, Computational Logic, Inc. (May 1989).
deChampeauxD., ‘Subproblem finder and instance checker, two cooperating modules for theorem provers’, J. Assoc. Comp. Mach. 33, 633–657 (October 1986).
Kaufmann, Matt, ‘DEFN-SK: An extension of the Boyer-Moore Theorem Prover to handle first-order quantifiers’, Tech. Report 43, Computational Logic, Inc. (May 1989).
McCarthy, J., Abrahams, P. W., Edwards, D. J., Hart, T. P., and Levin, M. I., MIT LISP 1.5 Programmer's Manual, MIT (1962).
ShoenfieldJ. R., Mathematical Logic, Addison-Wesley, Reading, Mass. (1967).
Boyer, Robert S., Goldschlag, David M., Kaufmann, Matt, and Moore, J Strother, ‘Functional instantiation in first order logic’, Tech. Report 44, Computational Logic, Inc. (May 1989).
Ketonen, Jussi, ‘EKL — Ramsey theorem’, Tech. Report, Department of Computer Science, Stanford University (December 1986).
KunenKenneth, Set Theory: An Introduction to Independence Proofs, North-Holland, New York (1980).
Author information
Authors and Affiliations
Additional information
This research was supported in part by ONR Contract N00014-88-C-0454. The views and conclusions contained in this document are those of the author and should not be interpreted as representing the official policies, either expressed or implied, of Computational Logic, Inc., the Office of Naval Research or the U.S. Government.
Rights and permissions
About this article
Cite this article
Kaufmann, M. An extension of the Boyer-Moore Theorem Prover to support first-order quantification. Journal of Automated Reasoning 9, 355–372 (1992). https://doi.org/10.1007/BF00245295
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00245295