Add to ORKGAbstract. Given a countable structure A, we dene the degree spectrum DS(A) of A to be the set of all enumeration degrees generated by the pre-sentations of A on the natural numbers. The co-spectrum of A is the set of all lower bounds of DS(A). We prove some general properties of the de-gree spectra which show that they behave with respect to their co-spectra very much like the cones of enumeration degrees. Among the results are the analogs of Selman's Theorem [14], the Minimal Pair Theorem and the existence of a quasi-minimal enumeration degree. 1
In the paper the problem of existence of an algebraic structure with the degree spectra {x: x ≮ b} i...
We study Turing degrees a for which there is a countable structure whose degree spectrum is the col...
AbstractWe show that for every computably enumerable (c.e.) degree a>0 there is an intrinsically c.e...
Abstract. We present a relativized version of the notion of a degree spectrum of a structure with re...
Abstract. Two properties of the Co-spectrum of the Joint spectrum of infinitely many abstract struct...
Abstract. We introduce the notion of a degree spectrum of a complete theory to be the set of Turing ...
© 2016, Association for Symbolic Logic.We study Turing degrees a for which there is a countable stru...
We argue for the existence of structures with the spectrum {x : x ≥ a} of degrees, where a is an arb...
A standard way to capture the inherent complexity of the isomorphism type of a countable structure i...
Abstract. We study Turing degrees a for which there is a countable structure A whose degree spectrum...
We survey known results on spectra of structures and on spectra of relations on computable structure...
1.1. Degree Spectrum and Cospectrum of a structure. Let A = (N;R1; : : :; Rk) be a partial structure...
In computable model theory, mathematical structures are studied on the basis of their computability ...
In this survey, we discuss computability spectra of countable structures that provide a natural meas...
We analyze the degree spectra of structures in which different types of immunity conditions are enco...
In the paper the problem of existence of an algebraic structure with the degree spectra {x: x ≮ b} i...
We study Turing degrees a for which there is a countable structure whose degree spectrum is the col...
AbstractWe show that for every computably enumerable (c.e.) degree a>0 there is an intrinsically c.e...
Abstract. We present a relativized version of the notion of a degree spectrum of a structure with re...
Abstract. Two properties of the Co-spectrum of the Joint spectrum of infinitely many abstract struct...
Abstract. We introduce the notion of a degree spectrum of a complete theory to be the set of Turing ...
© 2016, Association for Symbolic Logic.We study Turing degrees a for which there is a countable stru...
We argue for the existence of structures with the spectrum {x : x ≥ a} of degrees, where a is an arb...
A standard way to capture the inherent complexity of the isomorphism type of a countable structure i...
Abstract. We study Turing degrees a for which there is a countable structure A whose degree spectrum...
We survey known results on spectra of structures and on spectra of relations on computable structure...
1.1. Degree Spectrum and Cospectrum of a structure. Let A = (N;R1; : : :; Rk) be a partial structure...
In computable model theory, mathematical structures are studied on the basis of their computability ...
In this survey, we discuss computability spectra of countable structures that provide a natural meas...
We analyze the degree spectra of structures in which different types of immunity conditions are enco...
In the paper the problem of existence of an algebraic structure with the degree spectra {x: x ≮ b} i...
We study Turing degrees a for which there is a countable structure whose degree spectrum is the col...
AbstractWe show that for every computably enumerable (c.e.) degree a>0 there is an intrinsically c.e...