scientific article
From MaRDI portal
Publication:3962986
zbMath0498.03033MaRDI QIDQ3962986
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items (14)
\(\Sigma_ 5\)-completeness of index sets arising from the recursively enumerable Turing degrees ⋮ Intervals containing exactly one c.e. degree ⋮ Joining to High Degrees ⋮ Cupping computably enumerable degrees simultaneously ⋮ Upper bounds on ideals in the computably enumerable Turing degrees ⋮ Strong noncuppability in low computably enumerable degrees ⋮ The d.r.e. degrees are not dense ⋮ Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets ⋮ Turing computability: structural theory ⋮ Elementary differences among jump classes ⋮ Tracing and domination in the Turing degrees ⋮ A non-splitting theorem for d.r.e. sets ⋮ CUPPING AND JUMP CLASSES IN THE COMPUTABLY ENUMERABLE DEGREES ⋮ Splitting theorems in recursion theory
This page was built for publication:
