Inductive types and exact completion

Annals of Pure and Applied Logic 134 (2-3):95-121 (2005)
  Copy   BIBTEX

Abstract

Using the theory of exact completions, I construct a certain class of pretoposes, consisting of what one might call “predicative realizability toposes”, that can act as categorical models of certain predicative type theories, including Martin-Löf Type Theory

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,990

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

Exact completion and constructive theories of sets.Jacopo Emmenegger & Erik Palmgren - 2020 - Journal of Symbolic Logic 85 (2):563-584.
More exact completions that are toposes.Matı́as Menni - 2002 - Annals of Pure and Applied Logic 116 (1-3):187-203.
Predicative functionals and an interpretation of ⌢ID.Jeremy Avigad - 1998 - Annals of Pure and Applied Logic 92 (1):1-34.
Inductive definitions over a predicative arithmetic.Stanley S. Wainer & Richard S. Williams - 2005 - Annals of Pure and Applied Logic 136 (1-2):175-188.

Analytics

Added to PP
2014-01-16

Downloads
28 (#557,911)

6 months
15 (#233,546)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Benno Van Den Berg
University of Amsterdam

References found in this work

Wellfounded trees in categories.Ieke Moerdijk & Erik Palmgren - 2000 - Annals of Pure and Applied Logic 104 (1-3):189-218.
Recursive models for constructive set theories.M. Beeson - 1982 - Annals of Mathematical Logic 23 (2-3):127-178.
Recursive models for constructive set theories.N. Beeson - 1982 - Annals of Mathematical Logic 23 (2/3):127.

Add more references