Realizability algebras: a program to well order R
From MaRDI portal
(Redirected from Realizability algebras: a program to well order R)
Realizability algebras: a program to well order \(\mathbb R\)
Realizability algebras: a program to well order \(\mathbb R\)
Recommendations
Cited in
(16)- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017
- Realizability models for a linear dependent PCF
- Realizability algebras. II: New models of \(\mathrm{ZF} + \mathrm{DC}\)
- Delimited control operators prove double-negation shift
- Realizability algebras III: some examples
- A new model construction by making a detour via intuitionistic theories. I: Operational set theory without choice is \(\Pi_1\)-equivalent to KP
- Preserving cardinals and weak forms of Zorn’s lemma in realizability models
- Implicative algebras: a new foundation for realizability and forcing
- A program for the full axiom of choice
- On the structure of classical realizability models of ZF
- Constructive forcing, CPS translations and witness extraction in interactive realizability
- Classical realizability and arithmetical formulæ
- Stateful Realizers for Nonstandard Analysis
- A first-order completeness result about characteristic Boolean algebras in classical realizability
- Implicative models of set theory
- Realizability with stateful computations for nonstandard analysis
This page was built for publication: Realizability algebras: a program to well order \(\mathbb R\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3224668)