Add to ORKGWe argue for the existence of structures with the spectrum {x : x ≥ a} of degrees, where a is an arbitrary low degree. Also it is stated that there exist structures with the spectrum of degrees, {x : x ≥ a} ⊂ {x : x ≥ b}, for any low degrees a and b. © 2007 Springer Science+Business Media, Inc
Abstract. We present a relativized version of the notion of a degree spectrum of a structure with re...
AbstractWe show that for every computably enumerable (c.e.) degree a>0 there is an intrinsically c.e...
© 2020, Pleiades Publishing, Ltd. Abstract: The investigation of computability in topological struct...
We argue for the existence of structures with the spectrum {x : x ≥ a} of degrees, where a is an arb...
In the paper the problem of existence of an algebraic structure with the degree spectra {x: x ≮ b} i...
We survey known results on spectra of structures and on spectra of relations on computable structure...
Abstract. We study Turing degrees a for which there is a countable structure A whose degree spectrum...
Abstract. We introduce the notion of a degree spectrum of a complete theory to be the set of Turing ...
Abstract. Given a countable structure A, we dene the degree spectrum DS(A) of A to be the set of all...
We construct the degree b ≤ 0″ admitting no algebraic structure with degree spectrum {x: x ≰ b}. Mor...
© 2016, Association for Symbolic Logic.We study Turing degrees a for which there is a countable stru...
We analyze the degree spectra of structures in which different types of immunity conditions are enco...
We study Turing degrees a for which there is a countable structure whose degree spectrum is the col...
A standard way to capture the inherent complexity of the isomorphism type of a countable structure i...
Abstract. For any P ⊆ 2ω, define S(P), the degree spectrum of P, to be the set of all Turing degrees...
Abstract. We present a relativized version of the notion of a degree spectrum of a structure with re...
AbstractWe show that for every computably enumerable (c.e.) degree a>0 there is an intrinsically c.e...
© 2020, Pleiades Publishing, Ltd. Abstract: The investigation of computability in topological struct...
We argue for the existence of structures with the spectrum {x : x ≥ a} of degrees, where a is an arb...
In the paper the problem of existence of an algebraic structure with the degree spectra {x: x ≮ b} i...
We survey known results on spectra of structures and on spectra of relations on computable structure...
Abstract. We study Turing degrees a for which there is a countable structure A whose degree spectrum...
Abstract. We introduce the notion of a degree spectrum of a complete theory to be the set of Turing ...
Abstract. Given a countable structure A, we dene the degree spectrum DS(A) of A to be the set of all...
We construct the degree b ≤ 0″ admitting no algebraic structure with degree spectrum {x: x ≰ b}. Mor...
© 2016, Association for Symbolic Logic.We study Turing degrees a for which there is a countable stru...
We analyze the degree spectra of structures in which different types of immunity conditions are enco...
We study Turing degrees a for which there is a countable structure whose degree spectrum is the col...
A standard way to capture the inherent complexity of the isomorphism type of a countable structure i...
Abstract. For any P ⊆ 2ω, define S(P), the degree spectrum of P, to be the set of all Turing degrees...
Abstract. We present a relativized version of the notion of a degree spectrum of a structure with re...
AbstractWe show that for every computably enumerable (c.e.) degree a>0 there is an intrinsically c.e...
© 2020, Pleiades Publishing, Ltd. Abstract: The investigation of computability in topological struct...