|
Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2018, Number 1, Pages 67–74
(Mi ivm9320)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Computable linear orders and the Ershov hierarchy
Ya. A. Mikhailovskaya, A. N. Frolov Kazan Federal University,
18 Kremlyovskaya str., Kazan, 420008 Russia
Abstract:
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.
Received: 19.10.2016
Citation:
Ya. A. Mikhailovskaya, A. N. Frolov, “Computable linear orders and the Ershov hierarchy”, Izv. Vyssh. Uchebn. Zaved. Mat., 2018, no. 1, 67–74; Russian Math. (Iz. VUZ), 62:1 (2018), 58–64
Linking options:
https://www.mathnet.ru/eng/ivm9320 https://www.mathnet.ru/eng/ivm/y2018/i1/p67
|
Statistics & downloads: |
Abstract page: | 204 | Full-text PDF : | 39 | References: | 25 | First page: | 17 |
|