Add to ORKG© 2016, Allerton Press, Inc.We study the algorithmic complexity of natural relations on initial segments of computable linear orders. We prove that there exists a computable linear order with computable density relation such that its Π10-initial segment has no computable presentation with a computable density relation. We also prove that the same holds for a right limit and a left limit relations
In this paper we construct a low2 scattered linear orderings with no computable presentation. This i...
Abstract. We solve a longstanding question of Rosenstein, and make progress toward solving a long-st...
In this thesis, we study computable content of existing classical theorems on linearisations of part...
© 2016, Allerton Press, Inc.We study the algorithmic complexity of natural relations on initial segm...
We show there is a computable linear order with a # 0 2 initial segment that is not isomorphic to an...
© 2014, Pleiades Publishing, Ltd. We study an algorithmic dependence of natural relations on linear ...
We study computable linear orders with computable neighborhood and block predicates. In particular, ...
Linear orders and initial segments A linear order may be highly computable, but have complicated ini...
© 2018, Allerton Press, Inc. We give the collection of relations on computable linear orders. For an...
The main goal of this paper is to study algorithmic properties of countable linear orders by constru...
© 2020 Cambridge University Press. All rights reserved. We characterize the linear order types with ...
We consider the class of so-called k-quasidiscrete linear orderings, show that every k-quasi-discret...
We prove that a nontrivial degree spectrum of the successor relation of either strongly η-like or no...
Abstract. In this paper, we solve a long-standing open ques-tion (see, e.g., Downey [6, §7] and Down...
We say that L is weakly η-like if L/∼ is isomorphic to the natural ordering of rational numbers. We ...
In this paper we construct a low2 scattered linear orderings with no computable presentation. This i...
Abstract. We solve a longstanding question of Rosenstein, and make progress toward solving a long-st...
In this thesis, we study computable content of existing classical theorems on linearisations of part...
© 2016, Allerton Press, Inc.We study the algorithmic complexity of natural relations on initial segm...
We show there is a computable linear order with a # 0 2 initial segment that is not isomorphic to an...
© 2014, Pleiades Publishing, Ltd. We study an algorithmic dependence of natural relations on linear ...
We study computable linear orders with computable neighborhood and block predicates. In particular, ...
Linear orders and initial segments A linear order may be highly computable, but have complicated ini...
© 2018, Allerton Press, Inc. We give the collection of relations on computable linear orders. For an...
The main goal of this paper is to study algorithmic properties of countable linear orders by constru...
© 2020 Cambridge University Press. All rights reserved. We characterize the linear order types with ...
We consider the class of so-called k-quasidiscrete linear orderings, show that every k-quasi-discret...
We prove that a nontrivial degree spectrum of the successor relation of either strongly η-like or no...
Abstract. In this paper, we solve a long-standing open ques-tion (see, e.g., Downey [6, §7] and Down...
We say that L is weakly η-like if L/∼ is isomorphic to the natural ordering of rational numbers. We ...
In this paper we construct a low2 scattered linear orderings with no computable presentation. This i...
Abstract. We solve a longstanding question of Rosenstein, and make progress toward solving a long-st...
In this thesis, we study computable content of existing classical theorems on linearisations of part...