A structured set of higher-order problems

Lecture Notes in Computer Science

Volumn 3603, Issue , 2005, Pages 66-81

  Benzmüller, Christoph E ^a   Brown, Chad E ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; PROBLEM SOLVING; SEMANTICS;

COMPLETENESS ANALYSIS; DEDUCTIVE STRENGTHS; HIGHER-ORDER LOGICS; PROOF SYSTEMS;

SET THEORY;

EID: 26844488614     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11541868_5     Document Type: Conference Paper

References (30)

1. P.B. Andrews. General models and extensionality. J. of Symbolic Logic, 37(2):395-397, 1972.
2. P. B. Andrews. On Connections and Higher Order Logic. J. of Automated Reasoning, 5:257-291, 1989.
3. P. B. Andrews. Classical type theory. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume 2, chapter 15, pages 965-1007. Elsevier Science, 2001.
4. P. B. Andrews. An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof. Kluwer Academic Publishers, second edition, 2002.
5. P. B. Andrews, M. Bishop, and C. E. Brown. TPS: A theorem proving system for type theory. In D. McAllester, editor, Proc. of CADE-17, number 1831 in LNAI, pages 164-169, Pittsburgh, USA, 2000. Springer.
6. Peter B. Andrews. Resolution in type theory. J. of Symbolic Logic, 36(3):414-432, 1971.
7. C. Benzmüller. Equality and Extensionality in Automated Higher-Order Theorem Proving. PhD thesis, Saarland University, 1999.
8. C. Benzmüller, C. Brown, and M. Kohlhase. Higher-order semantics and extensionality. J. of Symbolic Logic, 69(4): 1027-1088, 2004.
9. C. Benzmüller, C. E. Brown, and M. Kohlhase. Semantic techniques for higher-order cut-elimination. SEKI Technical Report SR-2004-07, Saarland University, Saarbrücken, Germany, 2004. Available at: http://www.ags.uni- sb.de/~chris/ papers/R37.pdf.
10. C. Benzmüller and M. Kohlhase. LEO - a higher order theorem prover. In C. Kirchner and H. Kirchner, editors, Proc. of CADE-15, number 1421 in LNAI, pages 139-144, Lindau, Germany, 1998. Springer.
11. C. Benzmüller, V. Sorge, M. Jamnik, and M. Kerber. Can a higher-order and a first-order theorem prover cooperate? In F. Baader and A. Voronkov, editors, Proc. of LPAR 2004, volume 3452 of LNAI, pages 415-431. Springer, 2005.
12. M. P. Bonacina and J. Hsiang. Incompleteness of the RUE/NRF inference systems. Newsletter of the Association for Automated Reasoning, No. 20, pages 9-12, 1992.
13. G. Boolos. Logic, Logic, Logic. Harvard University Press, 1998.
14. C. E. Brown. Set Comprehension in Church's Type Theory. PhD thesis, Department of Mathematical Sciences, Carnegie Mellon University, 2004.
15. A. Church. A formulation of the simple theory of types. J. of Symbolic Logic, 5:56-68, 1940.
16. V. J. Digricoli. Resolution by unification and equality. In W. H. Joyner, editor, Proc. of CADE-4, Austin, Texas, USA, 1979.
17. Leon Henkin. Completeness in the theory of types. J. of Symbolic Logic, 15(2):81-91, 1950.
18. G. P. Huet. A unification algorithm for typed A-calculus. Theoretical Computer Science, 1:27-57, 1975.
19. M. Kohlhase. A Mechanization of Sorted Higher-Order Logic Based on the Resolution Principle. PhD thesis, Saarland University, 1994.
20. M. Kohlhase. Higher-order tableaux. In Proc. of TABLEAUX 95, number 918 in LNAI, pages 294-309. Springer, 1995.
21. J.D. McCharen, R.A. Overbeek, and L.A. Wos. Problems and Experiments for and with Automated Theorem-Proving Programs. IEEE Transactions on Computers, C-25(8):773-782, 1976.
22. D. Miller. Proofs in Higher-Order Logic. PhD thesis, Carnegie-Mellon Univ., 1983.
23. F. J. Pelletier. Seventy-five Problems for Testing Automatic Theorem Provers. J. of Automated Reasoning, 2(2): 191-216, 1986.
24. F.J. Pelletier, G. Sutcliffe, and C.B. Suttner. The Development of CASC. AI Communications, 15(2-3):79-90, 2002.
25. C. Prehofer. Solving Higher-Order Equations: From Logic to Programming. Progress in Theoretical Computer Science. Birkhäuser, 1998.
26. W. Snyder and J. Gallier. Higher-Order Unification Revisited: Complete Sets of Transformations. J. of Symbolic Computation, 8:101-140, 1989.
27. R. Statman. The typed A-calculus is not elementary recursive. Theoretical Computer Science, 9:73-81, 1979.
28. G. Sutcliffe and C. Suttner. The TPTP Problem Library: CNF Release v1.2.1. J. of Automated Reasoning, 21(2):177-203, 1998.
29. G.A. Wilson and J. Minker. Resolution, Refinements, and Search Strategies: A Comparative Study. IEEE Transactions on Computers, C-25(8):782-801, 1976.
30. C.-P. Wirth. Descente infinie + Deduction. Logic J. of the IGPL, 12(1):1-96, 2004. www.ags.uni-sb.de/~cp/p/d/welcome.html.