Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense

DOI10.2307/2274181zbMath0574.03027OpenAlexW2113444807MaRDI QIDQ3691654

S. Barry Cooper

Publication date: 1984

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

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

zbMATH Keywords

enumeration degreespartial degrees

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Theory of numerations, effectively presented structures (03D45)

Related Items (42)

The jump operation for structure degrees ⋮ A note on the enumeration degrees of 1-generic sets ⋮ Embedding finite lattices into the Σ₂⁰ enumeration degrees ⋮ The automorphism group of the enumeration degrees ⋮ Embedding the diamond in the Σ₂ enumeration degrees ⋮ There exists a maximal 3-c.e. enumeration degree ⋮ Extensions of two constructions of Ahmad ⋮ Strong enumeration reducibilities ⋮ Jumps of quasi-minimal enumeration degrees ⋮ IN MEMORIAM: BARRY COOPER 1943–2015 ⋮ The enumeration degrees: Local and global structural interactions ⋮ Cupping Classes of $\Sigma^0_2$ Enumeration Degrees ⋮ The relationship between local and global structure in the enumeration degrees ⋮ PA RELATIVE TO AN ENUMERATION ORACLE ⋮ Enumeration Reducibility and Computable Structure Theory ⋮ Density of the cototal enumeration degrees ⋮ Complements for enumeration \(\Pi_1^0\)-degrees ⋮ Unnamed Item ⋮ Cupping and definability in the local structure of the enumeration degrees ⋮ A high noncuppable \({\Sigma^0_2}\) \(e\)-degree ⋮ Branching in the \({\Sigma^0_2}\)-enumeration degrees: a new perspective ⋮ The automorphism group and definability of the jump operator in the \(\omega\)-enumeration degrees ⋮ The \(n\)-rea enumeration degrees are dense ⋮ On Kalimullin pairs ⋮ Defining totality in the enumeration degrees ⋮ The limitations of cupping in the local structure of the enumeration degrees ⋮ Bounding nonsplitting enumeration degrees ⋮ Diamond embeddings into the enumeration degrees ⋮ Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets ⋮ Cupping Δ₂⁰ enumeration degrees to 0_e′ ⋮ ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS ⋮ On cototality and the skip operator in the enumeration degrees ⋮ Regular enumerations ⋮ On restricted forms of enumeration reducibility ⋮ DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREES ⋮ On minimal pairs of enumeration degrees ⋮ Empty intervals in the enumeration degrees ⋮ The jump operator on the \(\omega \)-enumeration degrees ⋮ A non-splitting theorem in the enumeration degrees ⋮ Branching in the enumeration degrees of the \(\Sigma_2^0\) sets ⋮ Definability via Kalimullin pairs in the structure of the enumeration degrees ⋮ Noncappable enumeration degrees below 0_e^′

Cites Work

• Unnamed Item

This page was built for publication: Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense