Add to ORKGWe say that L is weakly η-like if L/∼ is isomorphic to the natural ordering of rational numbers. We construct a computable presentation of any low weakly η-like linear ordering with no strongly η-like interval. Also we prove that there exists a noncomputably presentable low2 weakly η-like linear ordering with no strongly η-like interval. © ; 2010 The Author. Published by Oxford University Press. All rights reserved
Abstract. We solve a longstanding question of Rosenstein, and make progress toward solving a long-st...
We prove that a nontrivial degree spectrum of the successor relation of either strongly η-like or no...
We show there is a computable linear order with a # 0 2 initial segment that is not isomorphic to an...
We say that L is weakly η-like if L/∼ is isomorphic to the natural ordering of rational numbers. We ...
We consider the class of so-called k-quasidiscrete linear orderings, show that every k-quasi-discret...
The main goal of this paper is to study algorithmic properties of countable linear orders by constru...
It is proved that, for any n ω, there exist countable linear orderings Ln whose Δ 2 0 -spectrum cons...
We completely describe ranges of η-functions of η-like linear orderings without computable presentat...
In this paper we construct a low2 scattered linear orderings with no computable presentation. This i...
AbstractIt is shown that for every nonzero r.e. degree c there is a linear ordering of degree c whic...
We characterize the linear order types τ with the property that given any countable linear order ℒ, ...
We develop an approach to the longstanding conjecture of H.A. Kierstead concerning the character of ...
© 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...
Abstract. We solve a longstanding question of Rosenstein, and make progress toward solving a long-st...
We prove that a nontrivial degree spectrum of the successor relation of either strongly η-like or no...
We show there is a computable linear order with a # 0 2 initial segment that is not isomorphic to an...
We say that L is weakly η-like if L/∼ is isomorphic to the natural ordering of rational numbers. We ...
We consider the class of so-called k-quasidiscrete linear orderings, show that every k-quasi-discret...
The main goal of this paper is to study algorithmic properties of countable linear orders by constru...
It is proved that, for any n ω, there exist countable linear orderings Ln whose Δ 2 0 -spectrum cons...
We completely describe ranges of η-functions of η-like linear orderings without computable presentat...
In this paper we construct a low2 scattered linear orderings with no computable presentation. This i...
AbstractIt is shown that for every nonzero r.e. degree c there is a linear ordering of degree c whic...
We characterize the linear order types τ with the property that given any countable linear order ℒ, ...
We develop an approach to the longstanding conjecture of H.A. Kierstead concerning the character of ...
© 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...
Abstract. We solve a longstanding question of Rosenstein, and make progress toward solving a long-st...
We prove that a nontrivial degree spectrum of the successor relation of either strongly η-like or no...
We show there is a computable linear order with a # 0 2 initial segment that is not isomorphic to an...