 |
PREUVES, PROGRAMMES et SYSTÈMES |  |
|
PREUVES, PROGRAMMES et SYSTÈMES | |
| HAL : hal-00155291, version 1 |
| DOI : 10.1007/11617990_17 |
| Fiche détaillée |  Récupérer au format |
 |
| Types for Proofs and Programs, (2006) |
|
|
|
|
| On Constructive Existence |
|
|
| Michel Parigot 1 |
|
|
| (2006) |
|
|
|
| Baaz and Fermueller gave in 2003 an original characterization of constructive existence in classical logic. In this paper, we give a simple proof of this result based on cut-elimination in sequent calculus. The interest of this proof besides its simplicity is that it allows in particular to generalize the result to other logics enjoying cut-elimination. We also briefly discuss the significance of the characterization itself. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Preuves, Programmes et Systèmes (PPS) |
|
|
|
CNRS : UMR7126 – Université Paris VII - Paris Diderot |
|
|
|
|
|
|
|
|
|
| Domaine | : | Mathématiques/Logique |
| hal-00155291, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00155291 | |
| oai:hal.archives-ouvertes.fr:hal-00155291 | |
| Contributeur : Michel Parigot | |
| Soumis le : Dimanche 17 Juin 2007, 21:11:09 | |
| Dernière modification le : Dimanche 17 Juin 2007, 21:11:09 | |
