 |
PREUVES, PROGRAMMES et SYSTÈMES |  |
|
PREUVES, PROGRAMMES et SYSTÈMES | |
| HAL : hal-00498696, version 1 |
| DOI : 10.1007/s00153-010-0186-7 |
| Fiche détaillée |  Récupérer au format |
 |
| Archive for Mathematical Logic 49, 5 (2010) 529-554 |
|
|
|
|
| On the form of witness terms |
|
|
| Stefan Hetzl 1 |
|
|
| (26/04/2010) |
|
|
|
| We investigate the development of terms during cut-elimination in first-order logic and Peano arithmetic for proofs of existential formulas. The form of witness terms in cut-free proofs is characterized in terms of structured combinations of basic substitutions. Based on this result, a regular tree grammar computing witness terms is given and a class of proofs is shown to have only elementary cut-elimination. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Preuves, Programmes et Systèmes (PPS) |
|
|
|
CNRS : UMR7126 – Université Paris VII - Paris Diderot |
|
|
|
|
|
|
|
|
|
| Domaine | : | Mathématiques/Logique |
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| hal-00498696, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00498696 | |
| oai:hal.archives-ouvertes.fr:hal-00498696 | |
| Contributeur : Stefan Hetzl | |
| Soumis le : Jeudi 8 Juillet 2010, 11:04:50 | |
| Dernière modification le : Vendredi 9 Juillet 2010, 12:54:29 | |
