Publication:3962986
From MaRDI portal
zbMath0498.03033MaRDI QIDQ3962986
Publication date: 1981
03D25: Recursively (computably) enumerable sets and degrees
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets, Upper bounds on ideals in the computably enumerable Turing degrees, Tracing and domination in the Turing degrees, Intervals containing exactly one c.e. degree, Elementary differences among jump classes, The d.r.e. degrees are not dense, Splitting theorems in recursion theory, \(\Sigma_ 5\)-completeness of index sets arising from the recursively enumerable Turing degrees, Strong noncuppability in low computably enumerable degrees, A non-splitting theorem for d.r.e. sets, Joining to High Degrees