On minimal pairs of enumeration degrees

DOI10.2307/2273985zbMath0615.03031OpenAlexW2126750620MaRDI QIDQ4723719

Kevin McEvoy, S. Barry Cooper

Publication date: 1985

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

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

zbMATH Keywords

reducibilityTuring degreese-degreespairs of degrees

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (26)

Embedding finite lattices into the Σ₂⁰ enumeration degrees ⋮ Enumeration 1-genericity in the local enumeration degrees ⋮ Embedding the diamond in the Σ₂ enumeration degrees ⋮ There exists a maximal 3-c.e. enumeration degree ⋮ Strong enumeration reducibilities ⋮ Total Degrees and Nonsplitting Properties of $\Sigma_2^0$ Enumeration Degrees ⋮ The enumeration degrees: Local and global structural interactions ⋮ Badness and jump inversion in the enumeration degrees ⋮ Splitting and nonsplitting in the \(\Sigma_2^0\) enumeration degrees ⋮ Incomparability in local structures of \(s\)-degrees and \(Q\)-degrees ⋮ Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees ⋮ A high noncuppable \({\Sigma^0_2}\) \(e\)-degree ⋮ 1-genericity in the enumeration degrees ⋮ Bounding and nonbounding minimal pairs in the enumeration degrees ⋮ Bounding nonsplitting enumeration degrees ⋮ Goodness in the enumeration and singleton degrees ⋮ Diamond embeddings into the enumeration degrees ⋮ The distribution of properly Σ₂⁰ e-degrees ⋮ Structural properties and Σ₂⁰ enumeration degrees ⋮ ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS ⋮ On the jump classes of noncuppable enumeration degrees ⋮ On restricted forms of enumeration reducibility ⋮ Properly enumeration degrees and the high/low hierarchy ⋮ 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
• Unnamed Item
• On degrees of recursive unsolvability
• The upper semi-lattice of degrees of recursive unsolvability
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• Sublattices of the Recursively Enumerable Degrees
• Enumeration reducibility and partial degrees

This page was built for publication: On minimal pairs of enumeration degrees