Journal of Symbolic Logic

Higher-order semantics and extensionality

Christoph Benzmüller, Chad E. Brown, and Michael Kohlhase

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

In this paper we re-examine the semantics of classical higher-order logic with the purpose of clarifying the role of extensionality. To reach this goal, we distinguish nine classes of higher-order models with respect to various combinations of Boolean extensionality and three forms of functional extensionality. Furthermore, we develop a methodology of abstract consistency methods (by providing the necessary model existence theorems) needed to analyze completeness of (machine-oriented) higher-order calculi with respect to these model classes.

Article information

Source
J. Symbolic Logic, Volume 69, Issue 4 (2004), 1027-1088.

Dates
First available in Project Euclid: 2 December 2004

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1102022211

Digital Object Identifier
doi:10.2178/jsl/1102022211

Mathematical Reviews number (MathSciNet)
MR2135655

Zentralblatt MATH identifier
1071.03024

Citation

Benzmüller, Christoph; Brown, Chad E.; Kohlhase, Michael. Higher-order semantics and extensionality. J. Symbolic Logic 69 (2004), no. 4, 1027--1088. doi:10.2178/jsl/1102022211. https://projecteuclid.org/euclid.jsl/1102022211


Export citation

References

  • Peter B. Andrews Resolution in type theory, Journal of Symbolic Logic, vol. 36 (1971), no. 3, pp. 414--432.
  • 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.
  • 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, vol. 16 (1996), no. 3, pp. 321--353.
  • Henk P. Barendregt The lambda calculus, North-Holland,1984.
  • Christoph Benzmüller Equality and extensionality in automated higher-order theorem proving, Ph.D. thesis, Saarland University,1999.
  • 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.
  • Christoph Benzmüller and Michael Kohlhase Extensional higher order resolution, in Kirchner and Kirchner [?], pp. 56--72.
  • Wolfgang Bibel and Peter Schmitt (editors) Automated deduction---a basis for applications, Kluwer,1998.
  • Gennaro Chierchia and Raymond Turner Semantics and property theory, Linguistics and Philosophy, vol. 11 (1988), pp. 261--302.
  • Alonzo Church A formulation of the simple theory of types, Journal of Symbolic Logic, vol. 5 (1940), pp. 56--68.
  • 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.
  • Mary DeMarco Intuitionistic semantics for heriditarily harrop logic programming, Ph.D. thesis, Wesleyan University,1999.
  • Gilles Dowek, Thérèse Hardin, and Claude Kirchner HOL-$\lambda\sigma$ an intentional first-order expression of higher-order logic, Mathematical Structures in Computer Science, vol. 11 (2001), no. 1, pp. 1--25.
  • Melvin Fitting First-order logic and automated theorem proving, second ed., Graduate Texts in Computer Science, Springer-Verlag,1996.
  • 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 [?].
  • M. J. C. Gordon and T. F. Melham Introduction to HOL---a theorem proving environment for higher order logic, Cambridge University Press,1993.
  • Leon Henkin Completeness in the theory of types, Journal of Symbolic Logic, vol. 15 (1950), no. 2, pp. 81--91.
  • Roger J. Hindley and Jonathan P. Seldin Introduction to combinators and lambda-calculs, Cambridge University Press, Cambridge,1986.
  • K. J. J. Hintikka Form and content in quantification theory, Acta Philosophica Fennica, vol. 8 (1955), pp. 7--55.
  • Furio Honsell and Marina Lenisa Coinductive characterizations of applicative structures, Mathematical Structures in Computer Science, vol. 9 (1999), pp. 403--435.
  • 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.
  • Gérard P. Huet Constrained resolution: A complete method for higher order logic, Ph.,D. thesis, Case Western Reserve University,1972.
  • D. C. Jensen and Thomasz Pietrzykowski A complete mechanization of $(\omega)$-order type theory, Proceedings of the ACM annual conference, vol. 1,1972, pp. 82--92.
  • 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.
  • Michael Kohlhase A mechanization of sorted higher-order logic based on the resolution principle, Ph.,D. thesis, Saarland University,1994.
  • Michael Kohlhase and Ortwin Scheja Higher-order multi-valued resolution, Journal of Applied Non-Classical Logics, vol. 9 (1999), no. 4, pp. 155--178.
  • Shalom Lappin and Carl Pollard Strategies for hyperintensional semantics, manuscript, King's College, London and Ohio State University,2000.
  • Richard Larson and Gabriel Segal Knowledge of meaning, MIT Press,1995.
  • Dale Miller Proofs in higher-order logic, Ph.,D. thesis, Carnegie-Mellon University,1983.
  • John C. Mitchell Foundations for programming languages, Foundations of Computing, MIT Press,1996.
  • Gopalan Nadathur and Dale Miller Higher-order logic programming, Technical Report CS-1994-38, Department of Computer Science, Duke University,1994.
  • 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.
  • J. Alan Robinson and Andrei Voronkov Handbook of automated reasoning, MIT Press,2001.
  • 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.
  • Lutz Schröder Henkin models for the partial $\lambda$-calculus, manuscript, http://www.informatik.uni-bre% men.de/~lschrode/hascasl/henkin.ps},{2002.
  • Kurt Schütte Semantical and syntactical properties of simple type theory, Journal of Symbolic Logic, vol. 25 (1960), pp. 305--326.
  • 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.
  • Raymond M. Smullyan A unifying principle for quantification theory, Proceedings of the National Academy of Sciences, vol. 49 (1963), pp. 828--832.
  • Moto-o Takahashi Cut-elimination in simple type theory with extensionality, Journal of the Mathematical Society of Japan, vol. 19 (1967), pp. 399--410.
  • Gaisi Takeuti Proof theory, North-Holland,1987.
  • R. Tomason A model theory for proposistional attitudes, Linguistics and Philosophy, vol. 4 (1980), pp. 47--70.
  • 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.
  • David A. Wolfram A semantics for $\lambda$-PROLOG, Theoretical Computer Science, vol. 136 (1994), no. 1, pp. 277--289.