Double jumps of minimal degrees
From MaRDI portal
Publication:4198741
DOI10.2307/2273510zbMath0411.03034OpenAlexW2144999713MaRDI QIDQ4198741
David B. Posner, Carl G. jun. Jockusch
Publication date: 1978
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2273510
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items (18)
There is no ordering on the classes in the generalized high/low hierarchies ⋮ Upper bounds for the arithmetical degrees ⋮ A non-inversion theorem for the jump operator ⋮ 2-minimality, jump classes and a note on natural definability ⋮ Automorphism bases for degrees of unsolvability ⋮ Generics for computable Mathias forcing ⋮ Array nonrecursiveness and relative recursive enumerability ⋮ Domination, forcing, array nonrecursiveness and relative recursive enumerability ⋮ A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES ⋮ Joining up to the generalized high degrees ⋮ 1-generic degrees and minimal degrees in higher recursion theory. II ⋮ Local Initial Segments of The Turing Degrees ⋮ Decidability and Invariant Classes for Degree Structures ⋮ A 2-MINIMAL NON-GL2 DEGREE ⋮ Multiple genericity: a new transfinite hierarchy of genericity notions ⋮ 1-generic splittings of computably enumerable degrees ⋮ Degrees of Dowd-type generic oracles ⋮ Degrees which do not bound minimal degrees
Cites Work
- Unnamed Item
- Unnamed Item
- Countable retracing functions and \(\Pi_2^0\) predicates
- On degrees of unsolvability
- Minimal degrees and the jump operator
- Banach–Mazur games, comeager sets and degrees of unsolvability
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- Initial segments of the degrees of unsolvability Part II: minimal degrees
- Degrees of unsolvability complementary between recursively enumerable degrees, Part 1
This page was built for publication: Double jumps of minimal degrees
