On Lachlan's major sub-degree problem

DOI10.1007/S00153-008-0083-5zbMATH Open1153.03017OpenAlexW1982982969MaRDI QIDQ943340FDOQ943340

Authors: S. Barry Cooper, Angsheng Li 

Publication date: 9 September 2008

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-008-0083-5

Recommendations

• The continuity of cupping to \(\text \textbf{0}'\)
• The strong anticupping property for recursively enumerable degrees
• Splittings of 0' into the Recursively Enumerable Degrees
• Cupping the Recursively Enumerable Degrees by D.R.E. Degrees
• Joining to high degrees via noncuppables

zbMATH Keywords

Turing degreecomputably enumerable setmajor sub-degree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Undecidability and degrees of sets of sentences (03D35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The recursively enumerable degrees are dense
• Title not available (Why is that?)
• Pseudo Jump Operators. I: The R. E. Case
• Recursively enumerable sets of positive integers and their decision problems
• On the degrees less than 0'
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• Title not available (Why is that?)
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Interpolation and embedding in the recursively enumerable degrees
• A recursively enumerable degree which will not split over all lesser ones
• Working below a \(low_ 2\) recursively enumerable degree
• On the Lattice of Recursively Enumerable Sets
• A minimal pair of recursively enumerable degrees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algebraic aspects of the computably enumerable degrees.
• Bounding minimal pairs
• Minimal pairs and high recursively enumerable degrees
• The continuity of cupping to \(\text \textbf{0}'\)
• Splitting and nonsplitting, II: A low₂ c.e. degree above which 0′ is not splittable
• Title not available (Why is that?)

Cited In (2)

• Principal filters definable by parameters in 𝓔_bT
• Continuity of capping in \(\mathcal C_{\text{bT}}\)

This page was built for publication: On Lachlan's major sub-degree problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q943340)