Add to ORKG© 2016, Association for Symbolic Logic.We study Turing degrees a for which there is a countable structure A whose degree spectrum is the collection {x: x ≰ a}. In particular, for degrees a from the interval [0ʹ, 0ʺ ], such a structure exists if aʹ = 0ʺ, and there are no such structures if aʺ > 0ʺʹ
This thesis is concerned with various degree structures below 0', varying from Turing degrees to tr...
In the paper the problem of existence of an algebraic structure with the degree spectra {x: x ≮ b} i...
We establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c.e. Turi...
© 2016, Association for Symbolic Logic.We study Turing degrees a for which there is a countable stru...
Abstract. We study Turing degrees a for which there is a countable structure A whose degree spectrum...
We study Turing degrees a for which there is a countable structure whose degree spectrum is the col...
We argue for the existence of structures with the spectrum {x : x ≥ a} of degrees, where a is an arb...
Abstract. Given a countable structure A, we dene the degree spectrum DS(A) of A to be the set of all...
We survey known results on spectra of structures and on spectra of relations on computable structure...
Abstract. For any P ⊆ 2ω, define S(P), the degree spectrum of P, to be the set of all Turing degrees...
Abstract. We introduce the notion of a degree spectrum of a complete theory to be the set of Turing ...
© 2020, Pleiades Publishing, Ltd. Abstract: The investigation of computability in topological struct...
A standard way to capture the inherent complexity of the isomorphism type of a countable structure i...
Defining the degree of categoricity of a computable structure M to be the least degree d for which M...
An algebraic field extension of ℚ or ℤ/(p) may be regarded either as a structure in its own right, o...
This thesis is concerned with various degree structures below 0', varying from Turing degrees to tr...
In the paper the problem of existence of an algebraic structure with the degree spectra {x: x ≮ b} i...
We establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c.e. Turi...
© 2016, Association for Symbolic Logic.We study Turing degrees a for which there is a countable stru...
Abstract. We study Turing degrees a for which there is a countable structure A whose degree spectrum...
We study Turing degrees a for which there is a countable structure whose degree spectrum is the col...
We argue for the existence of structures with the spectrum {x : x ≥ a} of degrees, where a is an arb...
Abstract. Given a countable structure A, we dene the degree spectrum DS(A) of A to be the set of all...
We survey known results on spectra of structures and on spectra of relations on computable structure...
Abstract. For any P ⊆ 2ω, define S(P), the degree spectrum of P, to be the set of all Turing degrees...
Abstract. We introduce the notion of a degree spectrum of a complete theory to be the set of Turing ...
© 2020, Pleiades Publishing, Ltd. Abstract: The investigation of computability in topological struct...
A standard way to capture the inherent complexity of the isomorphism type of a countable structure i...
Defining the degree of categoricity of a computable structure M to be the least degree d for which M...
An algebraic field extension of ℚ or ℤ/(p) may be regarded either as a structure in its own right, o...
This thesis is concerned with various degree structures below 0', varying from Turing degrees to tr...
In the paper the problem of existence of an algebraic structure with the degree spectra {x: x ≮ b} i...
We establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c.e. Turi...