Minimal pairs and high recursively enumerable degrees
From MaRDI portal
Publication:4067085
DOI10.2307/2272849zbMath0309.02047OpenAlexW2167819410MaRDI QIDQ4067085
Publication date: 1975
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2272849
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items
There is no ordering on the classes in the generalized high/low hierarchies ⋮ Intervals and sublattices of the r.e. weak truth table degrees. I: Density ⋮ Intervals and sublattices of the r.e. weak truth table degrees. II: Nonbounding ⋮ Recursively enumerable \(m\)- and \(tt\)-degrees. II: The distribution of singular degrees ⋮ Splitting into degrees with low computational strength ⋮ Minimal pairs in initial segments of the recursively enumerable degrees ⋮ Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree ⋮ Nonbounding and Slaman triples ⋮ IN MEMORIAM: BARRY COOPER 1943–2015 ⋮ Some results about the R.E. degrees ⋮ Complementing cappable degrees in the difference hierarchy. ⋮ A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES ⋮ On Lachlan's major sub-degree problem ⋮ Extending the Cooper minimal pair theorem ⋮ On boolean lowness and boolean highness ⋮ Bounding computably enumerable degrees in the Ershov hierarchy ⋮ Elementary differences among jump classes ⋮ Recursively enumerable sets and degrees ⋮ T-Degrees, Jump Classes, and Strong Reducibilities ⋮ Tracing and domination in the Turing degrees ⋮ Some orbits for \({\mathcal E}\) ⋮ The existence of high nonbounding degrees in the difference hierarchy
