Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-15T05:06:11.568Z Has data issue: false hasContentIssue false

Higher-order semantics and extensionality

Published online by Cambridge University Press:  12 March 2014

Christoph Benzmüller
Affiliation:
Department of Computer Science, Saarland University, Saarbrücken, Germany, E-mail: chris@ags.uni-sb.de, URL: http://www.ags.uni-sb.de/~chris
Chad E. Brown
Affiliation:
Department of Mathematics, Carnegie Mellon University, Pittsburgh, PA 15213, USA, E-mail: cebrown@andrew.cmu.edu, URL: http://www.andrew.cmu.edu/~cebrown/
Michael Kohlhase
Affiliation:
School of Engineering and Sciences, International University Bremen, Bremen, GermanySchool of Computer Science, Carnegie Mellon University, Pittsburgh, USA, E-mail: m.kohlhase@iu-bremen.de, URL: http://www.cs.cmu.edu/~kohlhase

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2004

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable