Add to ORKG© 2016, Allerton Press, Inc.We study the algorithmic complexity of natural relations on initial segm...
Abstract. A computable presentation of the linearly ordered set (ω,≤), where ω is the set of natural...
© 2017, Pleiades Publishing, Ltd.We find new sufficient conditions for the existence of a 0’-limitwi...
We completely describe ranges of η-functions of η-like linear orderings without computable presentat...
We say that L is weakly η-like if L/∼ is isomorphic to the natural ordering of rational numbers. We ...
It is proved that, for any n ω, there exist countable linear orderings Ln whose Δ 2 0 -spectrum cons...
We prove that a nontrivial degree spectrum of the successor relation of either strongly η-like or no...
In this paper we construct linear orderings whoseΔ 2 0 -spectra coincide with classes of all high0 a...
In this paper we construct a low2 scattered linear orderings with no computable presentation. This i...
The linear ordering problem : algorithms and applications. - Berlin : Heldermann, 1985. - XI, 158 S....
We characterize the linear order types τ with the property that given any countable linear order ℒ, ...
We consider the class of so-called k-quasidiscrete linear orderings, show that every k-quasi-discret...
© 2018, Allerton Press, Inc. We give the collection of relations on computable linear orders. For an...
AbstractGiven a set of points in Euclidean space, we say that two linear functionals differ on that ...
© 2016, Allerton Press, Inc.We study the algorithmic complexity of natural relations on initial segm...
Abstract. A computable presentation of the linearly ordered set (ω,≤), where ω is the set of natural...
© 2017, Pleiades Publishing, Ltd.We find new sufficient conditions for the existence of a 0’-limitwi...
We completely describe ranges of η-functions of η-like linear orderings without computable presentat...
We say that L is weakly η-like if L/∼ is isomorphic to the natural ordering of rational numbers. We ...
It is proved that, for any n ω, there exist countable linear orderings Ln whose Δ 2 0 -spectrum cons...
We prove that a nontrivial degree spectrum of the successor relation of either strongly η-like or no...
In this paper we construct linear orderings whoseΔ 2 0 -spectra coincide with classes of all high0 a...
In this paper we construct a low2 scattered linear orderings with no computable presentation. This i...
The linear ordering problem : algorithms and applications. - Berlin : Heldermann, 1985. - XI, 158 S....
We characterize the linear order types τ with the property that given any countable linear order ℒ, ...
We consider the class of so-called k-quasidiscrete linear orderings, show that every k-quasi-discret...
© 2018, Allerton Press, Inc. We give the collection of relations on computable linear orders. For an...
AbstractGiven a set of points in Euclidean space, we say that two linear functionals differ on that ...
© 2016, Allerton Press, Inc.We study the algorithmic complexity of natural relations on initial segm...
Abstract. A computable presentation of the linearly ordered set (ω,≤), where ω is the set of natural...
© 2017, Pleiades Publishing, Ltd.We find new sufficient conditions for the existence of a 0’-limitwi...