A Splitting Theorem for the N-R.E. Degrees

DOI10.2307/2159269MaRDI QIDQ3993783zbMATH OpenOpenAlexFDO

Authors S. Barry Cooper

Publication date 13 August 1992

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2159269

zbMATH Keywords

\(n\)-r.e. sets\(n\)-r.e. Turing degreescodingsplitting theorem

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Recommendations

• Splitting properties of r.e. sets and degrees
• A splitting theorem for n-REA degrees
• Non-uniformity and generalised Sacks splitting

Cited in

(20)

• A non-splitting theorem in the enumeration degrees
• Splitting theorems in recursion theory
• Complementing cappable degrees in the difference hierarchy.
• Non-uniformity and generalised Sacks splitting
• Interpolating d-r.e. and REA degrees between r.e. degrees
• Turing computability: structural theory
• Reductions between types of numberings
• Elementary theories and structural properties of d-c.e. and n-c.e. degrees
• A non-splitting theorem for d.r.e. sets
• A splitting theorem for n-REA degrees
• A survey of results on the d-c.e. and n-c.e. degrees
• There Are No Maximal d.c.e. wtt-degrees
• scientific article; zbMATH DE number 4031658 (Why is no real title available?)
• Splitting and nonsplitting, II: A low₂ c.e. degree above which 0′ is not splittable
• A Splitting with Infimum in the d-c. e. Degrees
• scientific article; zbMATH DE number 1420832 (Why is no real title available?)
• Degrees in Auslander–Reiten components with almost split sequences of at most two middle termss
• Special splitting in the 2-c.e. Turing degrees
• Splitting in 2-computably enumerable degrees with avoiding cones
• Model-theoretic properties of Turing degrees in the Ershov difference hierarchy

This page was built for publication: A Splitting Theorem for the N-R.E. Degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3993783)