Splitting and nonsplitting, II: A low2 c.e. degree above which 0′ is not splittable
From MaRDI portal
Publication:4451726
DOI10.2178/JSL/1190150292zbMATH Open1049.03029OpenAlexW2104229624MaRDI QIDQ4451726FDOQ4451726
Authors: S. Barry Cooper, Angsheng 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
Recommendations
- Splitting and nonsplitting in the \(\Sigma_2^0\) enumeration degrees
- Splitting theorems and low degrees
- Splittings of 0' into the Recursively Enumerable Degrees
- A Splitting Theorem for the N-R.E. Degrees
- A Splitting with Infimum in the d-c. e. Degrees
- A splitting theorem for \(n\)-REA degrees
- On the non-split extension \(2^{2n\cdot}\mathrm{Sp}(2n,2)\)
- scientific article; zbMATH DE number 1420832
- A nonlow\(_2\) r. e. degree with the extension of embeddings properties of a low\(_2\) degree
- Splitting in 2-computably enumerable degrees with avoiding cones
Cites Work
- The recursively enumerable degrees are dense
- Recursively enumerable sets of positive integers and their decision problems
- On the degrees less than 0'
- TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
- Interpolation and embedding in the recursively enumerable degrees
- Title not available (Why is that?)
- Working below a \(low_ 2\) recursively enumerable degree
- On the distribution of Lachlan nonsplitting bases
- Properly Σ2 Enumeration Degrees
Cited In (6)
This page was built for publication: Splitting and nonsplitting, II: A low2 c.e. degree above which 0′ is not splittable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4451726)
