On Lachlan's major sub-degree problem

DOI10.1007/S00153-008-0083-5MaRDI QIDQ943340zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

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

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)