Embedding the diamond in the Σ2 enumeration degrees

DOI10.2307/2274914zbMath0741.03023OpenAlexW2165579787MaRDI QIDQ3981454

Seema Ahmad

Publication date: 26 June 1992

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

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

zbMATH Keywords

diamond latticeenumeration degreesTuring degreeslow degree\(e\)-degreeslow approximation

Mathematics Subject Classification ID

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

Related Items (10)

Embedding finite lattices into the Σ₂⁰ enumeration degrees ⋮ Strong enumeration reducibilities ⋮ Total Degrees and Nonsplitting Properties of $\Sigma_2^0$ Enumeration Degrees ⋮ Splitting and nonsplitting in the \(\Sigma_2^0\) enumeration degrees ⋮ Branching in the \({\Sigma^0_2}\)-enumeration degrees: a new perspective ⋮ Diamond embeddings into the enumeration degrees ⋮ Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets ⋮ The Π₃-theory of the -enumeration degrees is undecidable ⋮ Branching in the enumeration degrees of the \(\Sigma_2^0\) sets ⋮ Splitting properties of n-c.e. enumeration degrees

Cites Work

• Unnamed Item
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• On minimal pairs of enumeration degrees
• Degrees of unsolvability complementary between recursively enumerable degrees, Part 1

This page was built for publication: Embedding the diamond in the Σ₂ enumeration degrees