Relative Enumerability in Ershov's Hierarchy
Matematičeskie zametki, Tome 84 (2008) no. 4, pp. 506-515
Voir la notice de l'article provenant de la source Math-Net.Ru
Generalizations to various levels of Ershov's hierarchy of the relationship between $n$-computable enumerability and relative enumerability are considered.
Keywords:
relative enumerability, $n$-computable enumerability, Ershov's hierarchy, constructive ordinal, Turing degree, computable function, limit ordinal.
@article{MZM_2008_84_4_a2,
author = {I. I. Batyrshin},
title = {Relative {Enumerability} in {Ershov's} {Hierarchy}},
journal = {Matemati\v{c}eskie zametki},
pages = {506--515},
publisher = {mathdoc},
volume = {84},
number = {4},
year = {2008},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MZM_2008_84_4_a2/}
}
I. I. Batyrshin. Relative Enumerability in Ershov's Hierarchy. Matematičeskie zametki, Tome 84 (2008) no. 4, pp. 506-515. http://geodesic.mathdoc.fr/item/MZM_2008_84_4_a2/