Add to ORKGIt is proved that, for any n ω, there exist countable linear orderings Ln whose Δ 2 0 -spectrum consists of exactly all non n-low Δ 2 0 -degrees. Properties of such orderings are examined, for n = 1 and n = 2. © 2006 Springer Science+Business Media, Inc
We completely describe ranges of η-functions of η-like linear orderings without computable presentat...
We establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c.e. Turi...
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...
In this paper we construct linear orderings whoseΔ 2 0 -spectra coincide with classes of all high0 a...
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...
We survey known results on spectra of structures and on spectra of relations on computable structure...
We prove that a nontrivial degree spectrum of the successor relation of either strongly η-like or no...
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 ℒ, ...
International audienceTwo linear orderings of a same set are perpendicular if every self-mapping of ...
© 2018, Allerton Press, Inc. We give the collection of relations on computable linear orders. For an...
Abstract. A computable presentation of the linearly ordered set (ω,≤), where ω is the set of natural...
We completely describe ranges of η-functions of η-like linear orderings without computable presentat...
We establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c.e. Turi...
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...
In this paper we construct linear orderings whoseΔ 2 0 -spectra coincide with classes of all high0 a...
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...
We survey known results on spectra of structures and on spectra of relations on computable structure...
We prove that a nontrivial degree spectrum of the successor relation of either strongly η-like or no...
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 ℒ, ...
International audienceTwo linear orderings of a same set are perpendicular if every self-mapping of ...
© 2018, Allerton Press, Inc. We give the collection of relations on computable linear orders. For an...
Abstract. A computable presentation of the linearly ordered set (ω,≤), where ω is the set of natural...
We completely describe ranges of η-functions of η-like linear orderings without computable presentat...
We establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c.e. Turi...
The main goal of this paper is to study algorithmic properties of countable linear orders by constru...