Add to ORKGAn algebraic field extension of ℚ or ℤ/(p) may be regarded either as a structure in its own right, or as a subfield of its algebraic closure F (either ℚ or ℤ/(p)). We consider the Turing degree spectrum of F in both cases, as a structure and as a relation on F, and characterize the sets of Turing degrees that are realized as such spectra. The results show a connection between enumerability in the structure F and computability when F is seen as a subfield of F. © 2009 Springer Berlin Heidelberg
Abstract. Given a countable structure A, we dene the degree spectrum DS(A) of A to be the set of all...
© 2018 The Association for Symbolic Logic. A Turing degree d is the degree of categoricity of a comp...
We establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c.e. Turi...
An algebraic field extension of ℚ or ℤ/(p) may be regarded either as a structure in its own right, o...
© 2019, Springer Nature Switzerland AG. We show that for both the unary relation of transcendence an...
© 2020, Pleiades Publishing, Ltd. Abstract: The investigation of computability in topological struct...
© 2016, Association for Symbolic Logic.We study Turing degrees a for which there is a countable stru...
Abstract. For any P ⊆ 2ω, define S(P), the degree spectrum of P, to be the set of all Turing degrees...
We survey known results on spectra of structures and on spectra of relations on computable structure...
A standard way to capture the inherent complexity of the isomorphism type of a countable structure i...
Abstract. We introduce the notion of a degree spectrum of a complete theory to be the set of Turing ...
AbstractThe spectrum of a relation R on a computable structure is the set of Turing degrees of the i...
In the paper the problem of existence of an algebraic structure with the degree spectra {x: x ≮ b} i...
Abstract. We study Turing degrees a for which there is a countable structure A whose degree spectrum...
We prove several results about the relationship between the word complexity function of a subshift a...
Abstract. Given a countable structure A, we dene the degree spectrum DS(A) of A to be the set of all...
© 2018 The Association for Symbolic Logic. A Turing degree d is the degree of categoricity of a comp...
We establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c.e. Turi...
An algebraic field extension of ℚ or ℤ/(p) may be regarded either as a structure in its own right, o...
© 2019, Springer Nature Switzerland AG. We show that for both the unary relation of transcendence an...
© 2020, Pleiades Publishing, Ltd. Abstract: The investigation of computability in topological struct...
© 2016, Association for Symbolic Logic.We study Turing degrees a for which there is a countable stru...
Abstract. For any P ⊆ 2ω, define S(P), the degree spectrum of P, to be the set of all Turing degrees...
We survey known results on spectra of structures and on spectra of relations on computable structure...
A standard way to capture the inherent complexity of the isomorphism type of a countable structure i...
Abstract. We introduce the notion of a degree spectrum of a complete theory to be the set of Turing ...
AbstractThe spectrum of a relation R on a computable structure is the set of Turing degrees of the i...
In the paper the problem of existence of an algebraic structure with the degree spectra {x: x ≮ b} i...
Abstract. We study Turing degrees a for which there is a countable structure A whose degree spectrum...
We prove several results about the relationship between the word complexity function of a subshift a...
Abstract. Given a countable structure A, we dene the degree spectrum DS(A) of A to be the set of all...
© 2018 The Association for Symbolic Logic. A Turing degree d is the degree of categoricity of a comp...
We establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c.e. Turi...