Abstract
In this paper we present an extensional higher-order resolution calculus that is complete relative to Henkin model semantics. The treatment of the extensionality principles — necessary for the completeness result — by specialized (goal-directed) inference rules is of practical applicability, as an implentation of the calculus in the LEO-System shows. Furthermore, we prove the long-standing conjecture, that it is sufficient to restrict the order of primitive substitutions to the order of input formulae.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Peter B. Andrews, Matthew Bishop, Sunil Issar, Dan Nesmith, Frank Pfenning, and Hongwei Xi. TPS: A theorem proving system for classical type theory. Journal of Automated Reasoning, 16(3):321–353, 1996.
Peter B. Andrews. Resolution in type theory. Journal of Symbolic Logic, 36(3):414–432, 1971.
Peter B. Andrews. General models descriptions and choice in type theory. Journal of Symbolic Logic, 37(2):385–394, 1972.
Peter B. Andrews. An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof. Academic Press, 1986.
Peter B. Andrews. On Connections and Higher Order Logic. Journal of Automated Reasoning, 5:257–291, 1989.
H. P. Barendregt. The Lambda Calculus. North Holland, 1984.
Christoph Benzmüller. A calculus and a system architecture for extensional higher-order resolution. Research Report 97-198, Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh,USA, June 1997.
Christoph Benzmüuller and Michael Kohlhase. Model existence for higher-order logic. SEKI-Report SR-97-09, UniversitÄt des Saarlandes, 1997.
Christoph Benzmüller and Michael Kohlhase. LEO, a higher-order theorem prover. to appear at CADE-15, 1998.
Nicolaas Govert de Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with an application to the Church-Rosser theorem. Indagationes Mathematicae, 34(5):381–392, 1972.
Kurt Gödel. über formal unentscheidbare SÄtze der Principia Mathematica und verwandter Systeme I. Monatshefte der Mathematischen Physik, 38:173–198, 1931.
Leon Henkin. Completeness in the theory of types. Journal of Symbolic Logic, 15(2):81–91, 1950.
Gérard P. Huet. A mechanization of type theory. In Donald E. Walker and Lewis Norton, editors, Proc. IJCAI'73, pages 139–146, 1973.
D. C. Jensen and T. Pietrzykowski. Mechanizing Ω-order type theory through unification. Theoretical Computer Science, 3:123–171, 1976.
Michael Kohlhase. A Mechanization of Sorted Higher-Order Logic Based on the Resolution Principle. PhD thesis, UniversitÄt des Saarlandes, 1994.
Michael Kohlhase. Higher-Order Tableaux. In P. Baumgartner, et al. eds, TABLEAUX'95, volume 918 of LNAI, pages 294–309, 1995.
Dale Miller. Proofs in Higher-Order Logic. PhD thesis, Carnegie-Mellon University, 1983.
Raymond M. Smullyan. A unifying principle for quantification theory. Proc. Nat. Acad Sciences, 49:828–832, 1963.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benzmüller, C., Kohlhase, M. (1998). Extensional higher-order resolution. In: Kirchner, C., Kirchner, H. (eds) Automated Deduction — CADE-15. CADE 1998. Lecture Notes in Computer Science, vol 1421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054248
Download citation
DOI: https://doi.org/10.1007/BFb0054248
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64675-4
Online ISBN: 978-3-540-69110-5
eBook Packages: Springer Book Archive