Realizability algebras: a program to well order R
From MaRDI portal
Publication:3224668
DOI10.2168/LMCS-7(3:2)2011zbMath1237.03012MaRDI QIDQ3224668
Publication date: 2 April 2012
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Logic in computer science (03B70) Consistency and independence results (03E35) Axiom of choice and related propositions (03E25) Combinatory logic and lambda calculus (03B40)
Related Items (10)
Stateful Realizers for Nonstandard Analysis ⋮ Realizability algebras III: some examples ⋮ Constructive forcing, CPS translations and witness extraction in Interactive realizability ⋮ Classical realizability and arithmetical formulæ ⋮ Delimited control operators prove double-negation shift ⋮ Implicative algebras: a new foundation for realizability and forcing ⋮ A new model construction by making a detour via intuitionistic theories. I: Operational set theory without choice is \(\Pi_1\)-equivalent to KP ⋮ Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017 ⋮ Preserving cardinals and weak forms of Zorn’s lemma in realizability models ⋮ Realizability models for a linear dependent PCF
This page was built for publication: Realizability algebras: a program to well order R
