Double jumps of minimal degrees
From MaRDI portal
Publication:4198741
Cites work
- Banach–Mazur games, comeager sets and degrees of unsolvability
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- Countable retracing functions and _2⁰ predicates
- Degrees of unsolvability complementary between recursively enumerable degrees, Part 1
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3387326 (Why is no real title available?)
- Initial segments of the degrees of unsolvability Part II: minimal degrees
- Minimal degrees and the jump operator
- On degrees of unsolvability
Cited in
(19)- Degrees which do not bound minimal degrees
- Upper bounds for the arithmetical degrees
- A non-inversion theorem for the jump operator
- Automorphism bases for degrees of unsolvability
- Token jumping in minor-closed classes
- Degrees of Dowd-type generic oracles
- Multiple genericity: a new transfinite hierarchy of genericity notions
- Generics for computable Mathias forcing
- 1-generic splittings of computably enumerable degrees
- A 2-MINIMAL NON-GL2 DEGREE
- Decidability and Invariant Classes for Degree Structures
- Joining up to the generalized high degrees
- 2-minimality, jump classes and a note on natural definability
- Local Initial Segments of The Turing Degrees
- A hierarchy of computably enumerable degrees
- Array nonrecursiveness and relative recursive enumerability
- Domination, forcing, array nonrecursiveness and relative recursive enumerability
- 1-generic degrees and minimal degrees in higher recursion theory. II
- There is no ordering on the classes in the generalized high/low hierarchies
This page was built for publication: Double jumps of minimal degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4198741)