Add to ORKGLet L be a quasidiscrete linear ordering. We specify some conditions for the existence of a computable presentation for L or for the structure (L, adj), where adj(x, y) is a predicate distinguishing adjacent elements. © 2009 Springer Science+Business Media, Inc
This thesis explores computable linear orders through Turing Reductions and codes zero jump and zero...
In a preceding paper, Bruyère and Carton introduced automata, as well as rational expressions, which...
We say that L is weakly η-like if L/∼ is isomorphic to the natural ordering of rational numbers. We ...
Let L be a quasidiscrete linear ordering. We specify some conditions for the existence of a computab...
The main goal of this paper is to study algorithmic properties of countable linear orders by constru...
We study computable linear orders with computable neighborhood and block predicates. In particular, ...
International audienceConsider a linear ordering equipped with a finite sequence of monadic predicat...
We consider the class of so-called k-quasidiscrete linear orderings, show that every k-quasi-discret...
© 2020 Cambridge University Press. All rights reserved. We characterize the linear order types with ...
Abstract. We solve a longstanding question of Rosenstein, and make progress toward solving a long-st...
© 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...
In this paper we construct a low2 scattered linear orderings with no computable presentation. This i...
This thesis explores computable linear orders through Turing Reductions and codes zero jump and zero...
In a preceding paper, Bruyère and Carton introduced automata, as well as rational expressions, which...
We say that L is weakly η-like if L/∼ is isomorphic to the natural ordering of rational numbers. We ...
Let L be a quasidiscrete linear ordering. We specify some conditions for the existence of a computab...
The main goal of this paper is to study algorithmic properties of countable linear orders by constru...
We study computable linear orders with computable neighborhood and block predicates. In particular, ...
International audienceConsider a linear ordering equipped with a finite sequence of monadic predicat...
We consider the class of so-called k-quasidiscrete linear orderings, show that every k-quasi-discret...
© 2020 Cambridge University Press. All rights reserved. We characterize the linear order types with ...
Abstract. We solve a longstanding question of Rosenstein, and make progress toward solving a long-st...
© 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...
In this paper we construct a low2 scattered linear orderings with no computable presentation. This i...
This thesis explores computable linear orders through Turing Reductions and codes zero jump and zero...
In a preceding paper, Bruyère and Carton introduced automata, as well as rational expressions, which...
We say that L is weakly η-like if L/∼ is isomorphic to the natural ordering of rational numbers. We ...