Computable linear orders and the Ershov hierarchy
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 1 (2022), pp. 85-89
Voir la notice de l'article provenant de la source Math-Net.Ru
This work corrects the inaccuracy of the authors' previous work. Namely, we correctly prove that there exists a computable linear order and a series of natural relations on it, the spectrum of which consist of exactly all $n$-c.e. degrees (for any natural number $n$).
Keywords:
computable linear orders, the degree spectrum of relations, $n$-computable enumerable ($n$-c.e.) degrees.
@article{IVM_2022_1_a7,
author = {Y. A. Michailovskaya and A. N. Frolov},
title = {Computable linear orders and the {Ershov} hierarchy},
journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
pages = {85--89},
publisher = {mathdoc},
number = {1},
year = {2022},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/IVM_2022_1_a7/}
}
Y. A. Michailovskaya; A. N. Frolov. Computable linear orders and the Ershov hierarchy. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 1 (2022), pp. 85-89. http://geodesic.mathdoc.fr/item/IVM_2022_1_a7/