Add to ORKGWe establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c.e. Turing degrees determined by b is the degree spectrum of the successor relation of some computable linear ordering. This follows from our main result, that for a large class of linear orderings the degree spectrum of the successor relation is closed upward in the c.e. Turing degrees. © 2008 Springer-Verlag
© 2019, Springer Nature Switzerland AG. We show that for both the unary relation of transcendence an...
AbstractWe show that for every computably enumerable (c.e.) degree a>0 there is an intrinsically c.e...
One of the most basic measures of the complexity of a given partially ordered structure is the quant...
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 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...
© 2018, Allerton Press, Inc. We give the collection of relations on computable linear orders. For an...
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. A computable presentation of the linearly ordered set (ω,≤), where ω is the set of natural...
Abstract. In this paper, we solve a long-standing open ques-tion (see, e.g., Downey [6, §7] and Down...
© 2016, Association for Symbolic Logic.We study Turing degrees a for which there is a countable stru...
A standard way to capture the inherent complexity of the isomorphism type of a countable structure i...
AbstractThe spectrum of a relation R on a computable structure is the set of Turing degrees of the i...
© 2019, Springer Nature Switzerland AG. We show that for both the unary relation of transcendence an...
AbstractWe show that for every computably enumerable (c.e.) degree a>0 there is an intrinsically c.e...
One of the most basic measures of the complexity of a given partially ordered structure is the quant...
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 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...
© 2018, Allerton Press, Inc. We give the collection of relations on computable linear orders. For an...
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. A computable presentation of the linearly ordered set (ω,≤), where ω is the set of natural...
Abstract. In this paper, we solve a long-standing open ques-tion (see, e.g., Downey [6, §7] and Down...
© 2016, Association for Symbolic Logic.We study Turing degrees a for which there is a countable stru...
A standard way to capture the inherent complexity of the isomorphism type of a countable structure i...
AbstractThe spectrum of a relation R on a computable structure is the set of Turing degrees of the i...
© 2019, Springer Nature Switzerland AG. We show that for both the unary relation of transcendence an...
AbstractWe show that for every computably enumerable (c.e.) degree a>0 there is an intrinsically c.e...
One of the most basic measures of the complexity of a given partially ordered structure is the quant...