scientific article
From MaRDI portal
Publication:3962986
zbMATH Open0498.03033MaRDI QIDQ3962986FDOQ3962986
Publication date: 1981
Title of this publication is not available (Why is that?)
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Cited In (14)
- Cupping computably enumerable degrees simultaneously
- Splitting theorems in recursion theory
- Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets
- The d.r.e. degrees are not dense
- Elementary differences among jump classes
- Joining to High Degrees
- Intervals containing exactly one c.e. degree
- Turing computability: structural theory
- \(\Sigma_ 5\)-completeness of index sets arising from the recursively enumerable Turing degrees
- CUPPING AND JUMP CLASSES IN THE COMPUTABLY ENUMERABLE DEGREES
- Upper bounds on ideals in the computably enumerable Turing degrees
- Tracing and domination in the Turing degrees
- A non-splitting theorem for d.r.e. sets
- Strong noncuppability in low computably enumerable degrees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3962986)
