Computable families of sets in Ershov hierarchy without principal numberings
Sibirskij žurnal čistoj i prikladnoj matematiki, Tome 15 (2015) no. 1, pp. 54-62
Voir la notice de l'article provenant de la source Math-Net.Ru
There was constructed example of computable family of sets without $\Sigma^{-1}_{a}$-principal numberings, for any $a\in\mathcal{O}$.
Keywords:
computable numbering, Ershov hierarchy.
@article{VNGU_2015_15_1_a4,
author = {S. S. Ospichev},
title = {Computable families of sets in {Ershov} hierarchy without principal numberings},
journal = {Sibirskij \v{z}urnal \v{c}istoj i prikladnoj matematiki},
pages = {54--62},
publisher = {mathdoc},
volume = {15},
number = {1},
year = {2015},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VNGU_2015_15_1_a4/}
}
TY - JOUR AU - S. S. Ospichev TI - Computable families of sets in Ershov hierarchy without principal numberings JO - Sibirskij žurnal čistoj i prikladnoj matematiki PY - 2015 SP - 54 EP - 62 VL - 15 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/VNGU_2015_15_1_a4/ LA - ru ID - VNGU_2015_15_1_a4 ER -
S. S. Ospichev. Computable families of sets in Ershov hierarchy without principal numberings. Sibirskij žurnal čistoj i prikladnoj matematiki, Tome 15 (2015) no. 1, pp. 54-62. http://geodesic.mathdoc.fr/item/VNGU_2015_15_1_a4/