Higher-order semantics and extensionality

Journal of Symbolic Logic

Volumn 69, Issue 4, 2004, Pages 1027-1088

  Benzmüller, Christoph ^a   Brown, Chad E ^c   Kohlhase, Michael ^b,d  

^a SAARLAND UNIVERSITY   (Germany)

^b JACOBS UNIVERSITY BREMEN   (Germany)

^c CARNEGIE MELLON UNIVERSITY   (United States)

^d NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 11844259431     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2178/jsl/1102022211     Document Type: Article

References (58)

1. PETER B. ANDREWS, Resolution in type theory, this JOURNAL, vol. 36 (1971), no. 3, pp. 414-432.
2. _, General models and extensionality, this JOURNAL, vol. 37 (1972), no. 2, pp. 395-397.
3. _, General models descriptions and choice in type theory, this JOURNAL, vol. 37 (1972), no. 2, pp. 385-394.
4. _, letter to Roger Hindley dated January 22, 1973.
5. _, On connections and higher order logic, Journal of Automated Reasoning, vol. 5 (1989), pp. 257-291.
6. _, An introduction to mathematical logic and type theory: To truth through proof, second ed., Kluwer Academic Publishers, 2002.
7. PETER B. ANDREWS, MATTHEW BISHOP, and CHAD E. BROWN, TPS: A theorem proving system for type theory, Proceedings of the 17th international conference on automated deduction (Pittsburgh, USA) (David McAllester, editor), Lecture Notes in Artifical Intelligence, no. 1831, Springer-Verlag, 2000, pp. 164-169.
8. PETER B. ANDREWS, MATTHEW BISHOP, SUNIL ISSAR, DAN NESMITH, FRANK PFENNING, and HONG-WEI XI, TPS: A theorem proving system for classical type theory, Journal of Automated Reasoning, vol. 16 (1996), no. 3, pp. 321-353.
9. HENK P. BARENDREGT, The lambda calculus, North-Holland, 1984.
10. CHRISTOPH BENZMÜLLER, Equality and extensionality in automated higher-order theorem proving, Ph.D. thesis, Saarland University, 1999.
11. _, Extensional higher-order paramodulation and RUE-resolution, Proceedings of the 16th international Conference on Automated Deduction (Trento, Italy) (Harald Ganzinger, editor), Lecture Notes in Artificial Intelligence, vol. 1632, Springer-Verlag, 1999, pp. 399-413.
12. CHRISTOPH BENZMÜLLER, CHAD E. BROWN, and MICHAEL KOHLHASE, Semantic techniques for higher-order cut-elimination, manuscript, http://www.ags.uni-sb. de/~chris/papers/R19.pdf, 2002.
13. CHRISTOPH BENZMÜLLER and MICHAEL KOHLHASE, Extensional higher order resolution, in Kirchner and Kirchner [35], pp. 56-72.
14. _, LEO - a higher order theorem prover, in Kirchner and Kirchner [35], pp. 139-144.
15. _, Model existence for higher-order logic, SEKI-Report SR-97-09, Saarland University, 1997.
16. Wolfgang Bibel and Peter Schmitt (editors), Automated deduction - a basis for applications, Kluwer, 1998.
17. GENNARO CHIERCHIA and RAYMOND TURNER, Semantics and property theory, Linguistics and Philosophy, vol. 11 (1988), pp. 261-302.
18. ALONZO CHURCH, A formulation of the simple theory of types, this JOURNAL, vol. 5 (1940), pp. 56-68.
19. 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, vol. 34 (1972), no. 5, pp. 381-392.
20. MARY DEMARCO, Intuitionistic semantics for heriditarily harrop logic programming, Ph.D. thesis, Wesleyan University, 1999.
21. GILLES DOWEK, THÉRÈSE HARDIN, and CLAUDE KIRCHNER, HOL-λ σ an intentional first-order expression of higher-order logic, Mathematical Structures in Computer Science, vol. 11 (2001), no. 1, pp. 1-25.
22. MELVIN FITTING, First-order logic and automated theorem proving, second ed., Graduate Texts in Computer Science, Springer-Verlag, 1996.
23. _, Types, tableaus, and Gödel's God, Kluwer, 2002.
24. KURT GÖDEL, Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I, Monatshefte der Mathematischen Physik, vol. 38 (1931), pp, 173-198, English version in [57].
25. M. J. C. GORDON and T. F. MELHAM, Introduction to HOL - a theorem proving environment for higher order logic, Cambridge University Press, 1993.
26. LEON HENKIN, Completeness in the theory of types, this JOURNAL, vol. 15 (1950), no. 2, pp. 81-91.
27. _, The discovery of my completeness proofs, The Bulletin of Symbolic Logic, vol. 2 (1996), no. 2, pp. 127-158.
28. ROGER J. HINDLEY and JONATHAN P. SELDIN, Introduction to combinators and lambda-calculs, Cambridge University Press, Cambridge, 1986.
29. K. J. J. HINTIKKA, Form and content in quantification theory, Acta Philosophica Fennica, vol. 8 (1955), pp. 7-55.
30. FURIO HONSELL and MARINA LENISA, Coinductive characterizations of applicative structures, Mathematical Structures in Computer Science, vol. 9 (1999), pp. 403-435.
31. FURIO HONSELL and DONALD SANNELLA, Pre-logical relations, Proceedings of computer science logic (CSL'99), Lecture Notes in Computer Science, vol. 1683, Springer-Verlag, 1999, pp. 546-561.
32. GÉRARD P. HUET, Constrained resolution: A complete method for higher order logic, Ph. D. thesis, Case Western Reserve University, 1972.
33. _, A mechanization of type theory, Proceedings of the 3rd international joint conference on artificial intelligence (Donald E. Walker and Lewis Norton, editors), 1973, pp. 139-146.
34. D. C. JENSEN and THOMASZ PIETRZYKOWSKI, A complete mechanization of(ω)-order type theory, Proceedings of the ACM annual conference, vol. 1, 1972, pp. 82-92.
35. Claude Kirchner and Hélène Kirchner (editors), Proceedings of the 15th Conference on Automated Deduction, Lecture Notes in Artificial Intelligence, vol. 1421, Springer-Verlag, 1998.
36. MICHAEL KOHLHASE, A mechanization of sorted higher-order logic basedon the resolution principle, Ph. D. thesis, Saarland University, 1994.
37. _, Higher-order tableaux, Theorem proving with analytic tableaux and related methods (Peter Baumgartner, Reiner Hähnle, and Joachim Posegga, editors), Lecture Notes in Artificial Intelligence, vol. 918, Springer-Verlag, 1995, pp. 294-309.
38. MICHAEL KOHLHASE and ORTWIN SCHEJA, Higher-order multi-valued resolution, Journal of Applied Non-Classical Logics, vol. 9 (1999), no. 4, pp. 155-178.
39. SHALOM LAPPIN and CARL POLLARD, Strategies for hyperintensional semantics, manuscript, King's College, London and Ohio State University, 2000.
40. _, A higher-order fine-grained logic for intensional semantics, manuscript, 2002.
41. RICHARD LARSON and GABRIEL SEGAL, Knowledge of meaning, MIT Press, 1995.
42. DALE MILLER, Proofs in higher-order logic, Ph. D. thesis, Carnegie-Mellon University, 1983.
43. _, A logic programming language with lambda-abstraction, function variables, and simple unification, Journal of Logic and Computation, vol. 4 (1991), no. 1, pp. 497-536.
44. JOHN C. MITCHELL, Foundations for programming languages, Foundations of Computing, MIT Press, 1996.
45. GOPALAN NADATHUR and DALE MILLER, Higher-order logic programming, Technical Report CS-1994-38, Department of Computer Science, Duke University, 1994.
46. TOBIAS NIPKOW, LAWRENCE C. PAULSON, and MARKUS WENZEL, Isabelle/HOL - a proof assistant for higher-order logic, Lecture Notes in Computer Science, vol. 2283, Springer-Verlag, 2002.
47. J. ALAN ROBINSON and ANDREI VORONKOV, Handbook of automated reasoning, MIT Press, 2001.
48. L. SCHRÖDER and T. MOSSAKOWSKI, Hascasl: towards integrated specification and development of functional programs, Algebraic methodology and software technology, Lecture Notes in Computer Science, vol. 2422, Springer-Verlag, 2002, pp. 99-116.
49. LUTZ SCHRÖDER, Henkin models for the partial λ-calculus, manuscript, http://www. informatik.uni-bremen.de/~lschrode/hascasl/henkin.ps, 2002.
50. KURT SCHÜTTE, Semantical and syntactical properties of simple type theory, this JOURNAL, vol. 25 (1960), pp. 305-326.
51. JÖRG SIEKMANN, CHRISTOPH BENZMÜLLER, et al., Proof development with OMEGA, Proceedings of the 18th international conference on automated deduction (Copenhagen, Denmark) (Andrei Voronkov, editor), Lecture Notes in Artificial Intelligence, vol. 2392, Springer-Verlag, 2002, pp. 144-149.
52. RAYMOND M. SMULLYAN, A unifying principle for quantification theory, Proceedings of the National Academy of Sciences, vol. 49 (1963), pp. 828-832.
53. _, First-order logic, Springer-Verlag, 1968.
54. MOTO-O TAKAHASHI, Cut-elimination in simple type theory with extensionality, Journal of the Mathematical Society of Japan, vol. 19 (1967), pp. 399-410.
55. GAISI TAKEUTI, Proof theory, North-Holland, 1987.
56. R. TOMASON, A model theory for proposistional attitudes, Linguistics and Philosophy, vol.4 (1980), pp. 47-70.
57. JEAN VAN HEIJENOORT, From Frege to Gödel: a source book in mathematical logic 1879-1931, 3rd printing, 1997 ed., Source books in the history of the sciences series, Harvard University Press, Cambridge, MA, 1967.
58. DAVID A. WOLFRAM, A semantics for λ-PROLOG, Theoretical Computer Science, vol. 136 (1994), no. 1, pp. 277-289.