Extensional Realizability and Choice for Dependent Types in Intuitionistic Set Theory

Journal of Symbolic Logic 88 (3):1138-1169 (2023)
  Copy   BIBTEX

Abstract

In [17], we introduced an extensional variant of generic realizability [22], where realizers act extensionally on realizers, and showed that this form of realizability provides inner models of $\mathsf {CZF}$ (constructive Zermelo–Fraenkel set theory) and $\mathsf {IZF}$ (intuitionistic Zermelo–Fraenkel set theory), that further validate $\mathsf {AC}_{\mathsf {FT}}$ (the axiom of choice in all finite types). In this paper, we show that extensional generic realizability validates several choice principles for dependent types, all exceeding $\mathsf {AC}_{\mathsf {FT}}$. We then show that adding such choice principles does not change the arithmetic part of either $\mathsf {CZF}$ or $\mathsf {IZF}$.

Links

PhilArchive



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

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

On Goodman Realizability.Emanuele Frittaion - 2019 - Notre Dame Journal of Formal Logic 60 (3):523-550.
Preservation of choice principles under realizability.Eman Dihoum & Michael Rathjen - 2019 - Logic Journal of the IGPL 27 (5):746-765.
A general notion of realizability.Lars Birkedal - 2002 - Bulletin of Symbolic Logic 8 (2):266-282.
Extensional Equality in the Classical Theory of Types.William Tait - 1995 - Vienna Circle Institute Yearbook 3:219-234.
Realizing Brouwer's sequences.Richard E. Vesley - 1996 - Annals of Pure and Applied Logic 81 (1-3):25-74.
Finite Sets and Natural Numbers in Intuitionistic TT.Daniel Dzierzgowski - 1996 - Notre Dame Journal of Formal Logic 37 (4):585-601.
Extended bar induction in applicative theories.G. R. Renardel Delavalette - 1990 - Annals of Pure and Applied Logic 50 (2):139-189.
Extended bar induction in applicative theories.Gerard R. Renardel de Lavalette - 1990 - Annals of Pure and Applied Logic 50 (2):139-189.
EM + Ext− + ACint is equivalent to ACext.Jesper Carlström - 2004 - Mathematical Logic Quarterly 50 (3):236-240.
EM + Ext_ + AC~i~n~t is equivalent to AC~e~x~t.Jesper Carlström - 2004 - Mathematical Logic Quarterly 50 (3):236.

Analytics

Added to PP
2022-07-22

Downloads
27 (#589,794)

6 months
9 (#308,564)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Constructive set theory.John Myhill - 1975 - Journal of Symbolic Logic 40 (3):347-382.
Constructivism in Mathematics, An Introduction.A. Troelstra & D. Van Dalen - 1991 - Tijdschrift Voor Filosofie 53 (3):569-570.
Formal systems for some branches of intuitionistic analysis.G. Kreisel - 1970 - Annals of Mathematical Logic 1 (3):229.
Realizability and recursive set theory.Charles McCarty - 1986 - Annals of Pure and Applied Logic 32:153-183.

View all 14 references / Add more references