Algèbres de réalisabilité: un programme pour bien ordonner R
Jean-Louis Krivine · arXiv (Cornell University) · 2010
We give a method to transform into programs, classical proofs using a well ordering of the reals. The technics uses a generalization of Cohen's forcing and the theory of classical realizability introduced by the author.