This article is cited 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.

UDC: 510.53

Received: 19.10.2016

 English version: Russian Mathematics (Izvestiya VUZ. Matematika), 2018, 62:1, 58–64

Bibliographic databases:

• 
•