Add to ORKG© 2018, Allerton Press, Inc. We give the collection of relations on computable linear orders. For any natural number n, the degree spectrum of such relations of some computable linear orders contains exactly all n-computable enumerable degrees. We also study interconnections of these relations among themselves
Generalizations to various levels of Ershov's hierarchy of the relationship between n-computable enu...
This thesis explores computable linear orders through Turing Reductions and codes zero jump and zero...
© 2014, Pleiades Publishing, Ltd. We study an algorithmic dependence of natural relations on linear ...
© 2018, Allerton Press, Inc. We give the collection of relations on computable linear orders. For an...
We establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c.e. Turi...
We prove that a nontrivial degree spectrum of the successor relation of either strongly η-like or no...
We survey known results on spectra of structures and on spectra of relations on computable structure...
In this paper we construct linear orderings whoseΔ 2 0 -spectra coincide with classes of all high0 a...
We establish that for every computably enumerable (c.e.) Turing degree b, the upper cone of c.e. Tur...
Abstract. A computable presentation of the linearly ordered set (ω,≤), where ω is the set of natural...
Abstract. In this paper, we solve a long-standing open ques-tion (see, e.g., Downey [6, §7] and Down...
Linear orders and initial segments A linear order may be highly computable, but have complicated ini...
We characterize the linear order types τ with the property that given any countable linear order ℒ, ...
Generalizations to various levels of Ershov's hierarchy of the relationship between n-computable enu...
This thesis explores computable linear orders through Turing Reductions and codes zero jump and zero...
© 2014, Pleiades Publishing, Ltd. We study an algorithmic dependence of natural relations on linear ...
© 2018, Allerton Press, Inc. We give the collection of relations on computable linear orders. For an...
We establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c.e. Turi...
We prove that a nontrivial degree spectrum of the successor relation of either strongly η-like or no...
We survey known results on spectra of structures and on spectra of relations on computable structure...
In this paper we construct linear orderings whoseΔ 2 0 -spectra coincide with classes of all high0 a...
We establish that for every computably enumerable (c.e.) Turing degree b, the upper cone of c.e. Tur...
Abstract. A computable presentation of the linearly ordered set (ω,≤), where ω is the set of natural...
Abstract. In this paper, we solve a long-standing open ques-tion (see, e.g., Downey [6, §7] and Down...
Linear orders and initial segments A linear order may be highly computable, but have complicated ini...
We characterize the linear order types τ with the property that given any countable linear order ℒ, ...
Generalizations to various levels of Ershov's hierarchy of the relationship between n-computable enu...
This thesis explores computable linear orders through Turing Reductions and codes zero jump and zero...
© 2014, Pleiades Publishing, Ltd. We study an algorithmic dependence of natural relations on linear ...