Computable linear orders and the Ershov hierarchy
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 1 (2018), pp. 67-74
Voir la notice de l'article provenant de la source Math-Net.Ru
We give the collection of relations on computable linear orders. For any natural number $n$, the degree spectrum of some such relation contains exactly all $n$-computable enumerable degrees. We also study interconnections of these relations among themselves.
Keywords:
computable linear orders, the degree spectrum of relations, $n$-computable enumerable degrees.
@article{IVM_2018_1_a7,
author = {Ya. A. Mikhailovskaya 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 = {67--74},
publisher = {mathdoc},
number = {1},
year = {2018},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/IVM_2018_1_a7/}
}
Ya. A. Mikhailovskaya; A. N. Frolov. Computable linear orders and the Ershov hierarchy. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 1 (2018), pp. 67-74. http://geodesic.mathdoc.fr/item/IVM_2018_1_a7/