
doi: 10.1017/jsl.2015.59
AbstractWe study Turing degrees a for which there is a countable structure ${\cal 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‴.
Families of c.e. sets, Recursively (computably) enumerable sets and degrees, degree spectra, families of c.e. sets, computably enumerable (c.e.) sets, Turing degrees, algebraic structures, Computably enumerable (c.e.) sets, 510, Algebraic structures, Other degrees and reducibilities in computability and recursion theory, Degree spectra, Theory of numerations, effectively presented structures
Families of c.e. sets, Recursively (computably) enumerable sets and degrees, degree spectra, families of c.e. sets, computably enumerable (c.e.) sets, Turing degrees, algebraic structures, Computably enumerable (c.e.) sets, 510, Algebraic structures, Other degrees and reducibilities in computability and recursion theory, Degree spectra, Theory of numerations, effectively presented structures
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 20 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
