Splitting and nonsplitting, II: A low2 c.e. degree above which 0′ is not splittable

DOI10.2178/jsl/1190150292zbMath1049.03029MaRDI QIDQ4451726

S. Barry Cooper, Ang Sheng Li

Publication date: 1 March 2004

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

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

zbMATH Keywords

Turing degrees; splitting and nonsplitting

Mathematics Subject Classification ID

03D25: Recursively (computably) enumerable sets and degrees

Related Items

A hierarchy for the plus cupping Turing degrees, A join theorem for the computably enumerable degrees, On Lachlan's major sub-degree problem, Elementary differences among jump classes

Cites Work

• Unnamed Item
• Working below a \(low_ 2\) recursively enumerable degree
• On the distribution of Lachlan nonsplitting bases
• The recursively enumerable degrees are dense
• Interpolation and embedding in the recursively enumerable degrees
• On the degrees less than 0'
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Properly Σ2 Enumeration Degrees
• Recursively enumerable sets of positive integers and their decision problems