 |
|
|
|
| HAL : hal-00483232, version 2 |
| arXiv : 1005.2395 |
| Fiche détaillée |  Récupérer au format |
|
|
| Logical Methods in Computer Science (LMCS) 7, 3 (2011) 1-47 |
|
|
| Versions disponibles : | v1 (13-05-2010) | v2 (10-05-2011) |
|
|
|
|
| Realizability algebras: a program to well order R |
|
|
| Jean-Louis Krivine 1 |
|
|
| (18/07/2011) |
|
|
|
| We give a method to transform into programs, classical proofs using a well ordering of the reals. The technology uses a generalization of Cohen's forcing and the theory of classical realizability introduced by the author. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Preuves, Programmes et Systèmes (PPS) |
|
|
|
CNRS : UMR7126 – Université Paris VII - Paris Diderot |
|
|
|
|
|
|
|
|
|
| Preuves, programmes et systèmes CNRS UMR 7126 |
|
|
|
|
| Domaine | : | Informatique/Logique en informatique |
|
|
| Curry-Howard correspondence – combinatory logic – lambda-calculus – axiom of choice |
|
|
|
| Liste des fichiers attachés à ce document : | ||||||||||
|
||||||||||
|
|
|
| hal-00483232, version 2 | |
| http://hal.archives-ouvertes.fr/hal-00483232 | |
| oai:hal.archives-ouvertes.fr:hal-00483232 | |
| Contributeur : Jean-Louis Krivine | |
| Soumis le : Lundi 9 Mai 2011, 22:36:23 | |
| Dernière modification le : Mardi 19 Juillet 2011, 13:53:56 | |
