Add to ORKGIn this paper we construct linear orderings whoseΔ 2 0 -spectra coincide with classes of all high0 and high1 degrees, respectively. We also prove that there exists a computable linear ordering such that its degree spectrum of the successor relation coincides with a fixed nonempty class of degrees which represents a Σ 1 0 -spectrum of some Ø′-computable linear ordering. © 2013 Allerton Press, Inc
In computable model theory, mathematical structures are studied on the basis of their computability ...
Abstract. In this paper, we solve a long-standing open ques-tion (see, e.g., Downey [6, §7] and Down...
We construct the degree b ≤ 0″ admitting no algebraic structure with degree spectrum {x: x ≰ b}. Mor...
In this paper we construct linear orderings whoseΔ 2 0 -spectra coincide with classes of all high0 a...
We prove that a nontrivial degree spectrum of the successor relation of either strongly η-like or no...
We establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c.e. Turi...
We establish that for every computably enumerable (c.e.) Turing degree b, the upper cone of c.e. Tur...
We survey known results on spectra of structures and on spectra of relations on computable structure...
© 2018, Allerton Press, Inc. We give the collection of relations on computable linear orders. For an...
It is proved that, for any n ω, there exist countable linear orderings Ln whose Δ 2 0 -spectrum cons...
Abstract. A computable presentation of the linearly ordered set (ω,≤), where ω is the set of natural...
Linear orders and initial segments A linear order may be highly computable, but have complicated ini...
In computable model theory, mathematical structures are studied on the basis of their computability ...
Abstract. In this paper, we solve a long-standing open ques-tion (see, e.g., Downey [6, §7] and Down...
We construct the degree b ≤ 0″ admitting no algebraic structure with degree spectrum {x: x ≰ b}. Mor...
In this paper we construct linear orderings whoseΔ 2 0 -spectra coincide with classes of all high0 a...
We prove that a nontrivial degree spectrum of the successor relation of either strongly η-like or no...
We establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c.e. Turi...
We establish that for every computably enumerable (c.e.) Turing degree b, the upper cone of c.e. Tur...
We survey known results on spectra of structures and on spectra of relations on computable structure...
© 2018, Allerton Press, Inc. We give the collection of relations on computable linear orders. For an...
It is proved that, for any n ω, there exist countable linear orderings Ln whose Δ 2 0 -spectrum cons...
Abstract. A computable presentation of the linearly ordered set (ω,≤), where ω is the set of natural...
Linear orders and initial segments A linear order may be highly computable, but have complicated ini...
In computable model theory, mathematical structures are studied on the basis of their computability ...
Abstract. In this paper, we solve a long-standing open ques-tion (see, e.g., Downey [6, §7] and Down...
We construct the degree b ≤ 0″ admitting no algebraic structure with degree spectrum {x: x ≰ b}. Mor...