Add to ORKGWe prove that a nontrivial degree spectrum of the successor relation of either strongly η-like or non-η-like computable linear orderings is closed upwards in the class of all computably enumerable degrees. We also show that the degree spectrum contains 0 if and only if either it is trivial or it contains all computably enumerable degrees. © 2010 Allerton Press, Inc
Let X be a unary relation on the domain of (ω,<). The degree spectrum of X on (ω,<) is the set of T...
© 2019, Springer Nature Switzerland AG. We show that for both the unary relation of transcendence an...
In computable model theory, mathematical structures are studied on the basis of their computability ...
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...
In this paper we construct linear orderings whoseΔ 2 0 -spectra coincide with classes of all high0 a...
We establish that for every computably enumerable (c.e.) Turing degree b, the upper cone of c.e. Tur...
© 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 survey known results on spectra of structures and on spectra of relations on computable structure...
Linear orders and initial segments A linear order may be highly computable, but have complicated ini...
Abstract. In this paper, we solve a long-standing open ques-tion (see, e.g., Downey [6, §7] and Down...
AbstractThe spectrum of a relation R on a computable structure is the set of Turing degrees of the i...
AbstractWe show that for every computably enumerable (c.e.) degree a>0 there is an intrinsically c.e...
It is proved that, for any n ω, there exist countable linear orderings Ln whose Δ 2 0 -spectrum cons...
Let X be a unary relation on the domain of (ω,<). The degree spectrum of X on (ω,<) is the set of T...
© 2019, Springer Nature Switzerland AG. We show that for both the unary relation of transcendence an...
In computable model theory, mathematical structures are studied on the basis of their computability ...
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...
In this paper we construct linear orderings whoseΔ 2 0 -spectra coincide with classes of all high0 a...
We establish that for every computably enumerable (c.e.) Turing degree b, the upper cone of c.e. Tur...
© 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 survey known results on spectra of structures and on spectra of relations on computable structure...
Linear orders and initial segments A linear order may be highly computable, but have complicated ini...
Abstract. In this paper, we solve a long-standing open ques-tion (see, e.g., Downey [6, §7] and Down...
AbstractThe spectrum of a relation R on a computable structure is the set of Turing degrees of the i...
AbstractWe show that for every computably enumerable (c.e.) degree a>0 there is an intrinsically c.e...
It is proved that, for any n ω, there exist countable linear orderings Ln whose Δ 2 0 -spectrum cons...
Let X be a unary relation on the domain of (ω,<). The degree spectrum of X on (ω,<) is the set of T...
© 2019, Springer Nature Switzerland AG. We show that for both the unary relation of transcendence an...
In computable model theory, mathematical structures are studied on the basis of their computability ...