Extensional higher-order resolution

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1421, Issue , 1998, Pages 56-71

  Benzmüller, Christoph ^a   Kohlhase, Michael ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; SEMANTICS; THEOREM PROVING;

EXTENSIONALITY; GOAL DIRECTED; HIGHER-ORDER; INFERENCE RULES; MODEL SEMANTICS;

CALCULATIONS;

EID: 84858341103     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0054248     Document Type: Conference Paper

References (18)

1. +96] Peter B. Andrews, Matthew Bishop, Sunil Issar, Dan Nesmith, Frank Pfenning, and Hongwei X. TPS: A theorem proving system for classical type theory. Journal of Automated Reasoning, 16(3): 321-353, 1996.
2. [And71] Peter B. Andrews. Resolution in type theory. Journal of Symbolic Logic, 36(3): 414-432, 1971.
3. [And72] Peter B. Andrews. General models descriptions and choice in type theory. Journal of Symbolic Logic, 37(2): 385-394, 1972.
4. [And86] Peter B. Andrews. An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof. Academic Press, 1986.
5. [And89] Peter B. Andrews. On Connections and Higher Order Logic. Journal of Automated Reasoning, 5: 257-291, 1989.
6. [Bar84] H.P. Barendregt. The Lambda Calculus. North Holland, 1984.
7. [Ben97] 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.
8. [BK97] Christoph Benzmiiuller and Michael Kohlhase. Model existence for higher-order logic. SEKI-Report SR-97-09, Universität des Saarlandes, 1997.
9. [BK98] Christoph Benzmiiller and Michael Kohlhase. LEO, a higher-order theorem prover. to appear at CADE-15, 1998.
10. [dB72] 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.
11. [Göd31] Kurt Gödel. Uber formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I. Monatshefte der Mathematischen Physik, 38: 173-198, 1931.
12. [Hen50] Leon Henkin. Completeness in the theory of types. Journal of Symbolic Logic, 15(2): 81-91, 1950.
13. [Hue73] Gérard P. Huet. A mechanization of type theory. In Donald E. Walker and Lewis Norton, editors, Proc. IJCAI'73, pages 139-146, 1973.
14. [JP76] D.C. Jensen and T. Pietrzykowski. Mechanizing ω-order type theory through unification. Theoretical Computer Science, 3: 123-171, 1976.
15. [Koh94] Michael Kohlhase. A Mechanization of Sorted Higher-Order Logic Based on the Resolution Principle. PhD thesis, Universität des Saarlandes, 1994.
16. [Koh95] Michael Kohlhase. Higher-Order Tableaux. In P. Baumgartner, et al. eds, TABLEAUX'95, volume 918 of LNAI, pages 294-309, 1995.
17. [Mil83] Dale Miller. Proofs in Higher-Order Logic. PhD thesis, Carnegie-Mellon University, 1983.
18. [Smu63] Raymond M. Smullyan. A unifying principle for quantification theory. Proc. Nat. Acad Sciences, 49: 828-832, 1963.