Models of intuitionistic set theory in subtoposes of nested realizability toposes

&
Annals of Pure and Applied Logic 166 (6):729-739 (2015)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2015.03.002

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,674

External links

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

Through your library

My notes

Similar books and articles

Relating First-Order Set Theories and Elementary Toposes.Steve Awodey & Thomas Streicher - 2007 - Bulletin of Symbolic Logic 13 (3):340-358.
Relating first-order set theories and elementary toposes.Steve Awodey, Carsten Butz & Alex Simpson - 2007 - Bulletin of Symbolic Logic 13 (3):340-358.
Extensional realizability.Jaap van Oosten - 1997 - Annals of Pure and Applied Logic 84 (3):317-349.
Local Realizability Toposes and a Modal Logic for Computability.Steve Awodey, Lars Birkedal & Dana Scott - unknown
A general notion of realizability.Lars Birkedal - 2002 - Bulletin of Symbolic Logic 8 (2):266-282.
Sheaf toposes for realizability.Steven Awodey & Andrej Bauer - 2008 - Archive for Mathematical Logic 47 (5):465-478.
Models of intuitionistic TT and N.Daniel Dzierzgowski - 1995 - Journal of Symbolic Logic 60 (2):640-653.
More exact completions that are toposes.Matı́as Menni - 2002 - Annals of Pure and Applied Logic 116 (1-3):187-203.
Relative and modified relative realizability.Lars Birkedal & Jaap van Oosten - 2002 - Annals of Pure and Applied Logic 118 (1-2):115-132.
Saturated models of intuitionistic theories.Carsten Butz - 2004 - Annals of Pure and Applied Logic 129 (1-3):245-275.
Realizability models refuting Ishiharaʼs boundedness principle.Peter Lietz & Thomas Streicher - 2012 - Annals of Pure and Applied Logic 163 (12):1803-1807.
Inductive types and exact completion.Benno van den Berg - 2005 - Annals of Pure and Applied Logic 134 (2-3):95-121.
Lifschitz realizability for intuitionistic Zermelo–Fraenkel set theory.Ray-Ming Chen & Michael Rathjen - 2012 - Archive for Mathematical Logic 51 (7-8):789-818.
In Domain Realizability, not all Functionals on C[–1, 1] are Continuous.Martín Escardó & Thomas Streicher - 2002 - Mathematical Logic Quarterly 48 (S1):41-44.
Computational adequacy for recursive types in models of intuitionistic set theory.Alex Simpson - 2004 - Annals of Pure and Applied Logic 130 (1-3):207-275.

Analytics

Added to PP
2015-08-28

Downloads
18 (#851,870)

6 months
9 (#349,017)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Some applications of Kleene's methods for intuitionistic systems.Harvey Friedman - 1973 - In A. R. D. Mathias & H. Rogers (eds.), Cambridge Summer School in Mathematical Logic. New York: Springer Verlag. pp. 113--170.
Can there be no nonrecursive functions?Joan Rand Moschovakis - 1971 - Journal of Symbolic Logic 36 (2):309-315.
Relative and modified relative realizability.Lars Birkedal & Jaap van Oosten - 2002 - Annals of Pure and Applied Logic 118 (1-2):115-132.

Add more references