Add to ORKG© 2014, Pleiades Publishing, Ltd. We study an algorithmic dependence of natural relations on linear orders relative to the class of their computable presentations. We give complete description of possible combinations of natural relations for which there is a computable linear order such that in any of its computable presentation a given combination of relations is not computable
Let L be a quasidiscrete linear ordering. We specify some conditions for the existence of a computab...
We survey known results on spectra of structures and on spectra of relations on computable structure...
AbstractThe spectrum of a relation R on a computable structure is the set of Turing degrees of the i...
© 2014, Pleiades Publishing, Ltd. We study an algorithmic dependence of natural relations on linear ...
© 2016, Allerton Press, Inc.We study the algorithmic complexity of natural relations on initial segm...
The main goal of this paper is to study algorithmic properties of countable linear orders by constru...
© 2018, Allerton Press, Inc. We give the collection of relations on computable linear orders. For an...
This thesis explores computable linear orders through Turing Reductions and codes zero jump and zero...
© 2020 Cambridge University Press. All rights reserved. We characterize the linear order types with ...
We prove that a nontrivial degree spectrum of the successor relation of either strongly η-like or no...
Abstract. A computable presentation of the linearly ordered set (ω,≤), where ω is the set of natural...
© 2020, Pleiades Publishing, Ltd. We show the spectral universality of the class of structures that ...
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 consider the class of so-called k-quasidiscrete linear orderings, show that every k-quasi-discret...
Let L be a quasidiscrete linear ordering. We specify some conditions for the existence of a computab...
We survey known results on spectra of structures and on spectra of relations on computable structure...
AbstractThe spectrum of a relation R on a computable structure is the set of Turing degrees of the i...
© 2014, Pleiades Publishing, Ltd. We study an algorithmic dependence of natural relations on linear ...
© 2016, Allerton Press, Inc.We study the algorithmic complexity of natural relations on initial segm...
The main goal of this paper is to study algorithmic properties of countable linear orders by constru...
© 2018, Allerton Press, Inc. We give the collection of relations on computable linear orders. For an...
This thesis explores computable linear orders through Turing Reductions and codes zero jump and zero...
© 2020 Cambridge University Press. All rights reserved. We characterize the linear order types with ...
We prove that a nontrivial degree spectrum of the successor relation of either strongly η-like or no...
Abstract. A computable presentation of the linearly ordered set (ω,≤), where ω is the set of natural...
© 2020, Pleiades Publishing, Ltd. We show the spectral universality of the class of structures that ...
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 consider the class of so-called k-quasidiscrete linear orderings, show that every k-quasi-discret...
Let L be a quasidiscrete linear ordering. We specify some conditions for the existence of a computab...
We survey known results on spectra of structures and on spectra of relations on computable structure...
AbstractThe spectrum of a relation R on a computable structure is the set of Turing degrees of the i...