Realizability algebras III : some examples

Jean-Louis Krivine (1)

1 PPS - Preuves, Programmes et Systèmes

We use the technique of "classical realizability" to build new models of ZF + DC in which R is not well ordered. This gives also a new method to get programs from proofs of arithmetical formulas with DC.

Mots clés: combinatory logic; set theory; Curry-Howard correspondence

Domaines: Logique en informatique [cs.LO]

Jean-Louis Krivine. Realizability algebras III : some examples. Mathematical Structures in Computer Science, 2018, 28 (1), pp. 45-76. ⟨hal-00743120v2⟩