|
This article is cited in 1 scientific paper (total in 1 paper)
Brief communications
Computable linear orders and the Ershov hierarchy
Y. A. Michailovskayaa, A. N. Frolovb a Kazan Federal University, 18 Kremlyovskaya str., Kazan, 420008 Russia
b Innopolis University, 1 Universitetskaya str., Innopolis, 420500 Russia
Abstract:
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.
Received: 17.12.2021 Revised: 17.12.2021 Accepted: 23.12.2021
Citation:
Y. A. Michailovskaya, A. N. Frolov, “Computable linear orders and the Ershov hierarchy”, Izv. Vyssh. Uchebn. Zaved. Mat., 2022, no. 1, 85–89; Russian Math. (Iz. VUZ), 66:1 (2022), 71–74
Linking options:
https://www.mathnet.ru/eng/ivm9746 https://www.mathnet.ru/eng/ivm/y2022/i1/p85
|
Statistics & downloads: |
Abstract page: | 109 | Full-text PDF : | 21 | References: | 10 | First page: | 16 |
|