Jumps of quasi-minimal enumeration degrees

DOI10.2307/2274335zbMath0595.03043OpenAlexW2047316241MaRDI QIDQ3726105

Kevin McEvoy

Publication date: 1985

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274335

zbMATH Keywords

e-degreequasi-minimal degree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items

The jump operation for structure degrees ⋮ Enumeration 1-genericity in the local enumeration degrees ⋮ The automorphism group of the enumeration degrees ⋮ Strong enumeration reducibilities ⋮ Unnamed Item ⋮ The enumeration degrees: Local and global structural interactions ⋮ Enumeration Reducibility and Computable Structure Theory ⋮ On some filters and ideals of the Medvedev lattice ⋮ Cupping and definability in the local structure of the enumeration degrees ⋮ A high noncuppable \({\Sigma^0_2}\) \(e\)-degree ⋮ Definability in the Local Theory of the ω-Enumeration Degrees ⋮ On Kalimullin pairs ⋮ Defining totality in the enumeration degrees ⋮ C-quasi-minimal enumeration degrees below \(\mathbf c'\) ⋮ Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets ⋮ On cototality and the skip operator in the enumeration degrees ⋮ On restricted forms of enumeration reducibility ⋮ The structure of the s-degrees contained within a single e-degree ⋮ DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREES ⋮ The high/low hierarchy in the local structure of the \(\omega\)-enumeration degrees ⋮ The jump operator on the \(\omega \)-enumeration degrees ⋮ Branching in the enumeration degrees of the \(\Sigma_2^0\) sets ⋮ Sets of generator and automorphism bases for the enumeration degrees ⋮ Definability via Kalimullin pairs in the structure of the enumeration degrees

Cites Work

• On degrees of recursive unsolvability
• On degrees of unsolvability
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• Reducibility and Completeness for Sets of Integers
• Minimal degrees and the jump operator
• Recursively enumerable sets and degrees
• Enumeration reducibility and partial degrees