Arithmetical classification of the set of all provably recursive functions
Commentationes Mathematicae Universitatis Carolinae, Tome 40 (1999) no. 4, pp. 631-634
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
The set of all indices of all functions provably recursive in any reasonable theory $T$ is shown to be recursively isomorphic to $U\times\overline{U}$, where $U$ is $\Pi_2$-complete set.
@article{CMUC_1999__40_4_a2,
author = {\v{S}vejdar, V{\'\i}t\v{e}zslav},
title = {Arithmetical classification of the set of all provably recursive functions},
journal = {Commentationes Mathematicae Universitatis Carolinae},
pages = {631--634},
publisher = {mathdoc},
volume = {40},
number = {4},
year = {1999},
mrnumber = {1756541},
zbl = {1010.03049},
language = {en},
url = {http://geodesic.mathdoc.fr/item/CMUC_1999__40_4_a2/}
}
TY - JOUR AU - Švejdar, Vítězslav TI - Arithmetical classification of the set of all provably recursive functions JO - Commentationes Mathematicae Universitatis Carolinae PY - 1999 SP - 631 EP - 634 VL - 40 IS - 4 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/CMUC_1999__40_4_a2/ LA - en ID - CMUC_1999__40_4_a2 ER -
Švejdar, Vítězslav. Arithmetical classification of the set of all provably recursive functions. Commentationes Mathematicae Universitatis Carolinae, Tome 40 (1999) no. 4, pp. 631-634. http://geodesic.mathdoc.fr/item/CMUC_1999__40_4_a2/