Minimal degrees and the jump operator
From MaRDI portal
Publication:4067086
DOI10.2307/2272061zbMath0309.02048OpenAlexW2167930025MaRDI QIDQ4067086
Publication date: 1973
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2272061
Related Items (30)
Upper bounds for the arithmetical degrees ⋮ Working below a high recursively enumerable degree ⋮ Jumps of quasi-minimal enumeration degrees ⋮ Minimal complements for degrees below 0′ ⋮ A non-inversion theorem for the jump operator ⋮ Dominating the Erdős-Moser theorem in reverse mathematics ⋮ A Π¹₁-uniformization principle for reals ⋮ 2-minimality, jump classes and a note on natural definability ⋮ IN MEMORIAM: BARRY COOPER 1943–2015 ⋮ Degree theoretic definitions of the low2 recursively enumerable sets ⋮ On the uniform computational content of computability theory ⋮ Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees ⋮ Complementing cappable degrees in the difference hierarchy. ⋮ A minimal degree not realizing least possible jump ⋮ Cofinal maximal chains in the Turing degrees ⋮ Jump inversions inside effectively closed sets and applications to randomness ⋮ Joining up to the generalized high degrees ⋮ Double jumps of minimal degrees over cardinals ⋮ A single minimal complement for the c.e. degrees ⋮ A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE ⋮ Minimal Covers and Hyperdegrees ⋮ Double jumps of minimal degrees ⋮ Tracing and domination in the Turing degrees ⋮ Degree Structures: Local and Global Investigations ⋮ Continuous versus Borel reductions ⋮ Degrees joining to 0′ ⋮ The upper semilattice of degrees ≤ 0′ is complemented ⋮ 1-generic splittings of computably enumerable degrees ⋮ The rhombus classes of degrees of unsolvability. I. The jump properties ⋮ Degrees which do not bound minimal degrees
Cites Work
This page was built for publication: Minimal degrees and the jump operator
