© 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ʺʹ
Abstract. We introduce the notion of a degree spectrum of a complete theory to be the set of Turing ...
© J.UCS.In this paper we introduce a hierarchy of families which can be derived from the integers us...
AbstractWe show that for every computably enumerable (c.e.) degree a>0 there is an intrinsically c.e...
© 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...
An algebraic field extension of ℚ or ℤ/(p) may be regarded either as a structure in its own right, o...
© 2020, Pleiades Publishing, Ltd. Abstract: The investigation of computability in topological struct...
Defining the degree of categoricity of a computable structure M to be the least degree d for which M...
We establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c.e. Turi...
Abstract. For any P ⊆ 2ω, define S(P), the degree spectrum of P, to be the set of all Turing degrees...
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 ...
© J.UCS.In this paper we introduce a hierarchy of families which can be derived from the integers us...
AbstractWe show that for every computably enumerable (c.e.) degree a>0 there is an intrinsically c.e...
© 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...
An algebraic field extension of ℚ or ℤ/(p) may be regarded either as a structure in its own right, o...
© 2020, Pleiades Publishing, Ltd. Abstract: The investigation of computability in topological struct...
Defining the degree of categoricity of a computable structure M to be the least degree d for which M...
We establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c.e. Turi...
Abstract. For any P ⊆ 2ω, define S(P), the degree spectrum of P, to be the set of all Turing degrees...
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 ...
© J.UCS.In this paper we introduce a hierarchy of families which can be derived from the integers us...
AbstractWe show that for every computably enumerable (c.e.) degree a>0 there is an intrinsically c.e...
Add to ORKG