Splitting and nonsplitting, II: A low2 c.e. degree above which 0′ is not splittable
A Turing degree \({\mathbf a}\) is an equivalence class of a set \(A \subset \omega\) with respect to the relation of the mutual Turing reducibility of sets. We say that a degree \({\mathbf a}\) is a computably enumerable (c.e.) degree if it contains a computably enumerable set. A degree \({\mathbf a}\) is called low\(_2\) if \({\mathbf a} = {\mathbf 0}\). The authors introduce the following terminology: a c.e. degree \({\mathbf a}\) is a Harrington nonsplitting base if \({\mathbf a} \not= {\mathbf 0}'\) and for any c.e. degrees \({\mathbf x},{\mathbf y}\) such that \({\mathbf x} \vee {\mathbf y} ={\mathbf 0}' \) we have either \({\mathbf x} \vee {\mathbf a} ={\mathbf 0}' \) or \({\mathbf y} \vee {\mathbf a} ={\mathbf 0}' \). It is shown that there exists a low\(_2\) Harrington nonsplitting base. This can be viewed as an interesting improvement of previous results for nonsplitting degrees. Moreover, the proof requires a new technique that was introduced by the authors. Its idea is connected with resolving conflicts between requirements during a construction by some sophisticated process of meshing of the infinitary strategies.
- 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
- scientific article; zbMATH DE number 1523417 (Why is no real title available?)
- Interpolation and embedding in the recursively enumerable degrees
- On the degrees less than 0'
- On the distribution of Lachlan nonsplitting bases
- Properly Σ2 Enumeration Degrees
- Recursively enumerable sets of positive integers and their decision problems
- The recursively enumerable degrees are dense
- TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
- Working below a \(low_ 2\) recursively enumerable degree
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)
