How enumeration reductibility yields extended Harrington non-splitting

DOI10.2178/jsl/1208359064zbMath1140.03018OpenAlexW2150152177MaRDI QIDQ3503759

S. Barry Cooper, Mariya Ivanova Soskova

Publication date: 9 June 2008

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1208359064

zbMATH Keywords

enumeration degreenonsplittingc.e. degreenoncupping

Mathematics Subject Classification ID

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

Related Items (5)

IN MEMORIAM: BARRY COOPER 1943–2015 ⋮ Splitting and nonsplitting in the \(\Sigma_2^0\) enumeration degrees ⋮ The high/low hierarchy in the local structure of the \(\omega\)-enumeration degrees ⋮ The jump operator on the \(\omega \)-enumeration degrees ⋮ A non-splitting theorem in the enumeration degrees

Cites Work

• Unnamed Item
• Logic year 1979--80, The University of Connecticut, USA
• The \(n\)-rea enumeration degrees are dense
• Classical recursion theory. Vol. II
• On the degrees less than 0'
• Degrees joining to 0′
• Bounding and nonbounding minimal pairs in the enumeration degrees

This page was built for publication: How enumeration reductibility yields extended Harrington non-splitting