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

DOI10.2307/2159269zbMath0771.03013OpenAlexW4236821868MaRDI QIDQ3993783

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

splitting theoremcoding\(n\)-r.e. sets\(n\)-r.e. Turing degrees

Mathematics Subject Classification ID

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

Related Items

Elementary theories and structural properties of d-c.e. and n-c.e. degrees ⋮ Interpolating \(d\)-r.e. and REA degrees between r.e. degrees ⋮ A Survey of Results on the d-c.e. and n-c.e. Degrees ⋮ There Are No Maximal d.c.e. wtt-degrees ⋮ Complementing cappable degrees in the difference hierarchy. ⋮ Turing computability: structural theory ⋮ Splitting in 2-computably enumerable degrees with avoiding cones ⋮ Model-theoretic properties of Turing degrees in the Ershov difference hierarchy ⋮ Reductions between types of numberings ⋮ A non-splitting theorem for d.r.e. sets ⋮ Splitting theorems in recursion theory ⋮ Non-uniformity and generalised Sacks splitting