Undecidability vs transfinite induction for the consistency of hyperarithmetical sets.
Archiv für mathematische Logik und Grundlagenforschung, Tome 22 (1982), pp. 19-26.

Voir la notice de l'article provenant de la source European Digital Mathematics Library

Mots-clés : semiformal system for description of hyperarithmetic computability
@article{AMLG_1982__22_137988,
     author = {S. Caporaso and G. Pani},
     title = {Undecidability vs transfinite induction for the consistency of hyperarithmetical sets.},
     journal = {Archiv f\"ur mathematische Logik und Grundlagenforschung},
     pages = {19--26},
     publisher = {mathdoc},
     volume = {22},
     year = {1982},
     zbl = {0494.03038},
     url = {http://geodesic.mathdoc.fr/item/AMLG_1982__22_137988/}
}
TY  - JOUR
AU  - S. Caporaso
AU  - G. Pani
TI  - Undecidability vs transfinite induction for the consistency of hyperarithmetical sets.
JO  - Archiv für mathematische Logik und Grundlagenforschung
PY  - 1982
SP  - 19
EP  - 26
VL  - 22
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/AMLG_1982__22_137988/
ID  - AMLG_1982__22_137988
ER  - 
%0 Journal Article
%A S. Caporaso
%A G. Pani
%T Undecidability vs transfinite induction for the consistency of hyperarithmetical sets.
%J Archiv für mathematische Logik und Grundlagenforschung
%D 1982
%P 19-26
%V 22
%I mathdoc
%U http://geodesic.mathdoc.fr/item/AMLG_1982__22_137988/
%F AMLG_1982__22_137988
S. Caporaso; G. Pani. Undecidability vs transfinite induction for the consistency of hyperarithmetical sets.. Archiv für mathematische Logik und Grundlagenforschung, Tome 22 (1982), pp. 19-26. http://geodesic.mathdoc.fr/item/AMLG_1982__22_137988/