Realizability algebras III: some examples
Jean-Louis Krivine · Mathematical Structures in Computer Science · 2016
We use the technique of “classical realizability” to build new models of ZF + DC in which R is not well ordered. This gives new relative consistency results, which are not obtainable by forcing. This gives also a new method to get programs from proofs of arithmetical formulas with dependent choice.