Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T16:04:30.013Z Has data issue: false hasContentIssue false

Topological completeness for higher-order logic

Published online by Cambridge University Press:  12 March 2014

S. Awodey
Affiliation:
Department of Philosophy, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213-3890, USA E-mail: awodey@cmu.edu
C. Butz
Affiliation:
Brics, Basic Research in Computer Science, Centre of the Danish National Research Foundation, Computer Science Department, Aarhus University, NY Munkegade, Bldg. 540, 8000 Aarhus C., Denmark E-mail: butz@brics.dk

Abstract

Using recent results in topos theory, two systems of higher-order logic are shown to be complete with respect to sheaf models over topological spaces—so-called “topological semantics”. The first is classical higher-order logic, with relational quantification of finitely high type; the second system is a predicative fragment thereof with quantification over functions between types, but not over arbitrary relations. The second theorem applies to intuitionistic as well as classical logic.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2000

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