Constructive Sheaf Semantics

Mathematical Logic Quarterly 43 (3):321-327 (1997)
  Copy   BIBTEX

Abstract

Sheaf semantics is developed within a constructive and predicative framework, Martin‐Löf's type theory. We prove strong completeness of many sorted, first order intuitionistic logic with respect to this semantics, by using sites of provably functional relations.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,154

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Negationless intuitionism.Enrico Martino - 1998 - Journal of Philosophical Logic 27 (2):165-177.
Minimal models of Heyting arithmetic.Ieke Moerdijk & Erik Palmgren - 1997 - Journal of Symbolic Logic 62 (4):1448-1460.
Topological completeness for higher-order logic.S. Awodey & C. Butz - 2000 - Journal of Symbolic Logic 65 (3):1168-1182.
Intuitionistic choice and classical logic.Thierry Coquand & Erik Palmgren - 2000 - Archive for Mathematical Logic 39 (1):53-74.

Analytics

Added to PP
2013-10-31

Downloads
51 (#421,935)

6 months
2 (#1,683,984)

Historical graph of downloads
How can I increase my downloads?

References found in this work

A model for intuitionistic non-standard arithmetic.Ieke Moerdijk - 1995 - Annals of Pure and Applied Logic 73 (1):37-51.
Pretopologies and completeness proofs.Giovanni Sambin - 1995 - Journal of Symbolic Logic 60 (3):861-878.

Add more references