Denotational semantics for intuitionistic type theory using a hierarchy of domains with totality

Archive for Mathematical Logic 38 (1):19-60 (1999)
  Copy   BIBTEX

Abstract

A modified version of Normann's hierarchy of domains with totality [9] is presented and is shown to be suitable for interpretation of Martin-Löf's intuitionistic type theory. This gives an interpretation within classical set theory, which is natural in the sense that $\Sigma$ -types are interpreted as sets of pairs and $\Pi$ -types as sets of choice functions. The hierarchy admits a natural definition of the total objects in the domains, and following an idea of Berger [3] this makes possible an interpretation where a type is defined to be true if its interpretation contains a total object. In particular, the empty type contains no total objects and will therefore be false (in any non-empty context). In addition, there is a natural equivalence relation on the total objects, so we derive a hierarchy of topological spaces (quotient spaces wrt. the Scott topology), and give a second interpretation using this hierarchy

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

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

Total objects in inductively defined types.Lill Kristiansen & Dag Normann - 1997 - Archive for Mathematical Logic 36 (6):405-436.
The Hausdorff-Ershov Hierarchy in Euclidean Spaces.Armin Hemmerling - 2006 - Archive for Mathematical Logic 45 (3):323-350.
A hierarchy of hereditarily finite sets.Laurence Kirby - 2008 - Archive for Mathematical Logic 47 (2):143-157.
Finite Sets and Natural Numbers in Intuitionistic TT.Daniel Dzierzgowski - 1996 - Notre Dame Journal of Formal Logic 37 (4):585-601.
Program semantics and classical logic.Reinhard Muskens - 1997) - In CLAUS Report Nr 86. Saarbrücken: University of the Saarland. pp. 1-27.

Analytics

Added to PP
2013-11-23

Downloads
25 (#618,847)

6 months
8 (#347,798)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Can partial indexings be totalized?Dieter Spreen - 2001 - Journal of Symbolic Logic 66 (3):1157-1185.
Hyperfinite type structures.Dag Normann, Erik Palmgren & Viggo Stoltenberg-Hansen - 1999 - Journal of Symbolic Logic 64 (3):1216-1242.
Limit spaces and transfinite types.Dag Normann & Geir Waagb - 2002 - Archive for Mathematical Logic 41 (6):525-539.
Can partial indexings be totalized?Dieter Spreen - 2001 - Journal of Symbolic Logic 66 (3):1157-1185.

Add more citations

References found in this work

Total sets and objects in domain theory.Ulrich Berger - 1993 - Annals of Pure and Applied Logic 60 (2):91-117.
Recursive models for constructive set theories.M. Beeson - 1982 - Annals of Mathematical Logic 23 (2-3):127-178.

Add more references