scientific article; zbMATH DE number 3784863

MaRDI QIDQ3962986zbMATH OpenFDO

Authors David Miller

Publication date 1981

zbMATH Keywords

anti-cupping propertyanti-cupping witness

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Cited in

(15)

• 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
• Turing computability: structural theory
• A non-splitting theorem for d.r.e. sets
• Joining to High Degrees
• Cupping and jump classes in the computably enumerable degrees
• Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets
• Cupping computably enumerable degrees simultaneously
• Upper bounds on ideals in the computably enumerable Turing degrees
• A nonsplitting theorem in the \(\mathrm{low}_2\) Turing degrees
• Tracing and domination in the Turing degrees
• Intervals containing exactly one c.e. degree

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)