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.
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