Abstract
We describe methods for automated theorem proving in extensional type theory with primitive equality. We discuss a complete, cut-free sequent calculus as well as a compact representation of cut-free (ground) proofs as extensional expansion dags. Automated proof search can be realized using a few operations to manipulate extensional expansion dags with variables. These search operations form a basis for complete search procedures. Procedures based on these ideas are implemented in the higher-order theorem prover Tps.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andrews, P.B.: A reduction of the axioms for the theory of propositional types. Fundamenta Mathematicae 52, 345–350 (1963)
Andrews, P.B.: Resolution in type theory. Journal of Symbolic Logic 36, 414–432 (1971)
Andrews, P.B.: On connections and higher-order logic. Journal of Automated Reasoning 5, 257–291 (1989)
Andrews, P.B.: Classical type theory. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, ch. 15, vol. 2, pp. 965–1007. Elsevier Science, Amsterdam (2001)
Andrews, P.B.: An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof, 2nd edn. Kluwer Academic Publishers, Dordrecht (2002)
Andrews, P.B., Bishop, M., Issar, S., Nesmith, D., Pfenning, F., Xi, H.: TPS: A theorem proving system for classical type theory. Journal of Automated Reasoning 16, 321–353 (1996)
Benzmüller, C.: Equality and Extensionality in Automated Higher-Order Theorem Proving. PhD thesis, Universität des Saarlandes (1999)
Benzmüller, C., Kohlhase, M.: System description: LEO - A higher-order theorem prover. In: Kirchner, C., Kirchner, H. (eds.) CADE 1998. LNCS (LNAI), vol. 1421, pp. 139–143. Springer, Heidelberg (1998)
Bledsoe, W.W., Feng, G.: Set-Var. Journal of Automated Reasoning 11, 293–314 (1993)
Brown, C.E.: Solving for set variables in higher-order theorem proving. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol. 2392, pp. 408–422. Springer, Heidelberg (2002)
Brown, C.E.: Set Comprehension in Church’s Type Theory. PhD thesis, Department of Mathematical Sciences, Carnegie Mellon University (2004)
Church, A.: A formulation of the simple theory of types. Journal of Symbolic Logic 5, 56–68 (1940)
Henkin, L.: A theory of propositional types. Fundamenta Mathematicae 52, 323–344 (1963)
Huet, G.P.: A unification algorithm for typed λ-calculus. Theoretical Computer Science 1, 27–57 (1975)
Miller, D.A.: Proofs in Higher-Order Logic. PhD thesis, Carnegie Mellon University, 81 pp (1983)
Miller, D.A.: A compact representation of proofs. Studia Logica 46(4), 347–370 (1987)
Pfenning, F.: Proof Transformations in Higher-Order Logic. PhD thesis, Carnegie Mellon University, 156 pp (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brown, C.E. (2005). Reasoning in Extensional Type Theory with Equality. In: Nieuwenhuis, R. (eds) Automated Deduction – CADE-20. CADE 2005. Lecture Notes in Computer Science(), vol 3632. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11532231_3
Download citation
DOI: https://doi.org/10.1007/11532231_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28005-7
Online ISBN: 978-3-540-31864-4
eBook Packages: Computer ScienceComputer Science (R0)