Extensional Higher-Order Paramodulation and RUE-Resolution
This paper presents two approaches to primitive equality treatment in higher-order (HO) automated theorem proving: a calculus EP adapting traditional first-order (FO) paramodulation [RW69], and a calculus εRUε adapting FO RUE-Resolution [Dig79] to classical type theory, i.e., HO logic based on Church’s simply typed λ-calculus. εP and εRUε extend the extensional HO resolution approach εR [BK98a]. In order to reach Henkin completeness without the need for additional extensionality axioms both calculi employ new, positive extensionality rules analogously to the respective negative ones provided by εR that operate on unification constraints. As the extensionality rules have an intrinsic and unavoidable difference-reducing character the HO paramodulation approach loses its pure term-rewriting character. On the other hand examples demonstrate that the extensionality rules harmonise quite well with the difference-reducing HO RUE-resolution idea.
KeywordsPrimitive Equality Rule Para Extensionality Principle Extensionality Rule Substitutivity Property
Unable to display preview. Download preview PDF.
- And86.P. B. Andrews. An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof. Academic Press, 1986.Google Scholar
- Bar84.H. P. Barendregt. The Lambda-Calculus: Its Syntax and Semantics. North-Holland, 2nd edition 1984.Google Scholar
- Ben99.C. Benzmüller. Equality and Extensionality in Automated Higher-Order Theorem Proving. PhD thesis, FB 14, Universität des Saarlandes, 1999.Google Scholar
- BK97.C. Benzmüller and M. Kohlhase. Model existence for higher-order logic. Seki-Report SR-97-09, FB 14, Universität des Saarlandes, 1997, submitted to JSL.Google Scholar
- BK98a.C. Benzmüller and M. Kohlhase. Extensional higher-order resolution. In Kirchner and Kirchner [KK98], pages 56–72.Google Scholar
- BK98b.C. Benzmüller and M. Kohlhase. LEO — a higher-order theorem prover. In Kirchner and Kirchner [KK98], pages 139–144.Google Scholar
- Dig79.V. J. Digricoli. Resolution by unification and equality. In W. H. Joyner, editor, Proc. of the 4th Workshop on Automated Deduction, Austin, 1979.Google Scholar
- Hue72.G. P. Huet. Constrained Resolution: A Complete Method for Higher Order Logic. PhD thesis, Case Western Reserve University, 1972.Google Scholar
- KK98.C. Kirchner and H. Kirchner, editors. Proc. of the 15th Conference on Automated Deduction, number 1421 in LNAI, Springer, 1998.Google Scholar
- Koh94.M. Kohlhase. A Mechanization of Sorted Higher-Order Logic Based on the Resolution Principle. PhD thesis, Universität des Saarlandes, 1994.Google Scholar
- Mil83.D. Miller. Proofs in Higher-Order Logic. PhD thesis, Carnegie-Mellon University, 1983.Google Scholar
- Wol93.D. Wolfram. The Clausal Theory of Types. Cambridge University Press, 1993.Google Scholar