
doi: 10.1007/bf01620762
[Part I is reviewed above (see Zbl 0631.03031).] An r.e. \(tt\)-degree is called singular if it contains exactly one r.e. m-degree, and a \(T\)-degree is called singular if it contains a singular r.e. tt-degree. Singular degrees were first constructed by \textit{A. N. Degtev} [Algebra Logika 12, 143-161 (1973; Zbl 0338.02023)]. We show \(\underset\sim 0'\) is singular, singular \(T\)-degrees are dense in the r.e. degrees, but there are nonsingular r.e. \(T\)-degrees.
tt-degrees, Recursively (computably) enumerable sets and degrees, T-degrees, Other degrees and reducibilities in computability and recursion theory, m-degrees
tt-degrees, Recursively (computably) enumerable sets and degrees, T-degrees, Other degrees and reducibilities in computability and recursion theory, m-degrees
| 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). | 4 | |
| 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. | Average | |
| 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 |
