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
We say that L is weakly η-like if L/∼ is isomorphic to the natural ordering of rational numbers. We ...
It is proved definability in FO+IFP of a global linear ordering on vertices of strongly extensional ...
Dedicated to Yuri Gurevich on the occasion of his seventieth birthday Abstract. Let M = (A,<, P) ...
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 consider the class of so-called k-quasidiscrete linear orderings, show that every k-quasi-discret...
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 characterize the linear order types τ with the property that given any countable linear order ℒ, ...
© 2014, Pleiades Publishing, Ltd. We study an algorithmic dependence of natural relations on linear ...
In this thesis, we study computable content of existing classical theorems on linearisations of part...
Abstract. We solve a longstanding question of Rosenstein, and make progress toward solving a long-st...
In this paper we construct a low2 scattered linear orderings with no computable presentation. This i...
© 2016, Allerton Press, Inc.We study the algorithmic complexity of natural relations on initial segm...
106 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2004.For each pair of linear order...
We say that L is weakly η-like if L/∼ is isomorphic to the natural ordering of rational numbers. We ...
It is proved definability in FO+IFP of a global linear ordering on vertices of strongly extensional ...
Dedicated to Yuri Gurevich on the occasion of his seventieth birthday Abstract. Let M = (A,<, P) ...
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 consider the class of so-called k-quasidiscrete linear orderings, show that every k-quasi-discret...
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 characterize the linear order types τ with the property that given any countable linear order ℒ, ...
© 2014, Pleiades Publishing, Ltd. We study an algorithmic dependence of natural relations on linear ...
In this thesis, we study computable content of existing classical theorems on linearisations of part...
Abstract. We solve a longstanding question of Rosenstein, and make progress toward solving a long-st...
In this paper we construct a low2 scattered linear orderings with no computable presentation. This i...
© 2016, Allerton Press, Inc.We study the algorithmic complexity of natural relations on initial segm...
106 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2004.For each pair of linear order...
We say that L is weakly η-like if L/∼ is isomorphic to the natural ordering of rational numbers. We ...
It is proved definability in FO+IFP of a global linear ordering on vertices of strongly extensional ...
Dedicated to Yuri Gurevich on the occasion of his seventieth birthday Abstract. Let M = (A,<, P) ...