AbstractWe show that for every computably enumerable (c.e.) degree a>0 there is an intrinsically c.e. relation on the domain of a computable structure of computable dimension 2 whose degree spectrum is {0,a}, thus answering a question of Goncharov and Khoussainov (Dokl. Math. 55 (1997) 55–57). We also show that this theorem remains true with α-c.e. in place of c.e. for any α∈ω∪{ω}. A modification of the proof of this result similar to what was done in Hirschfeldt (J. Symbolic Logic, to appear) shows that for any α∈ω∪{ω} and any α-c.e. degrees a0,…,an there is an intrinsically α-c.e. relation on the domain of a computable structure of computable dimension n+1 whose degree spectrum is {a0,…,an}. These results also hold for m-degree spectra of...
© 2016, Association for Symbolic Logic.We study Turing degrees a for which there is a countable stru...
We establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c.e. Turi...
In computable model theory, mathematical structures are studied on the basis of their computability ...
AbstractWe show that for every computably enumerable (c.e.) degree a>0 there is an intrinsically c.e...
AbstractThe spectrum of a relation R on a computable structure is the set of Turing degrees of the i...
Let X be a unary relation on the domain of (ω,<). The degree spectrum of X on (ω,<) is the set of T...
A standard way to capture the inherent complexity of the isomorphism type of a countable structure i...
© 2020, Pleiades Publishing, Ltd. Abstract: The investigation of computability in topological struct...
AbstractWhenever a structure with a particularly interesting computability-theoretic property is fou...
We survey known results on spectra of structures and on spectra of relations on computable structure...
Abstract. A computable presentation of the linearly ordered set (ω,≤), where ω is the set of natural...
We prove that a nontrivial degree spectrum of the successor relation of either strongly η-like or no...
© 2019, Springer Nature Switzerland AG. We show that for both the unary relation of transcendence an...
We argue for the existence of structures with the spectrum {x : x ≥ a} of degrees, where a is an arb...
In this survey, we discuss computability spectra of countable structures that provide a natural meas...
© 2016, Association for Symbolic Logic.We study Turing degrees a for which there is a countable stru...
We establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c.e. Turi...
In computable model theory, mathematical structures are studied on the basis of their computability ...
AbstractWe show that for every computably enumerable (c.e.) degree a>0 there is an intrinsically c.e...
AbstractThe spectrum of a relation R on a computable structure is the set of Turing degrees of the i...
Let X be a unary relation on the domain of (ω,<). The degree spectrum of X on (ω,<) is the set of T...
A standard way to capture the inherent complexity of the isomorphism type of a countable structure i...
© 2020, Pleiades Publishing, Ltd. Abstract: The investigation of computability in topological struct...
AbstractWhenever a structure with a particularly interesting computability-theoretic property is fou...
We survey known results on spectra of structures and on spectra of relations on computable structure...
Abstract. A computable presentation of the linearly ordered set (ω,≤), where ω is the set of natural...
We prove that a nontrivial degree spectrum of the successor relation of either strongly η-like or no...
© 2019, Springer Nature Switzerland AG. We show that for both the unary relation of transcendence an...
We argue for the existence of structures with the spectrum {x : x ≥ a} of degrees, where a is an arb...
In this survey, we discuss computability spectra of countable structures that provide a natural meas...
© 2016, Association for Symbolic Logic.We study Turing degrees a for which there is a countable stru...
We establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c.e. Turi...
In computable model theory, mathematical structures are studied on the basis of their computability ...