Embedding the diamond in the Σ2 enumeration degrees

DOI10.2307/2274914zbMath0741.03023MaRDI 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 lattice; enumeration degrees; Turing degrees; low degree; \(e\)-degrees; low approximation

Mathematics Subject Classification ID

03D25: Recursively (computably) enumerable sets and degrees

03D30: Other degrees and reducibilities in computability and recursion theory

Related Items

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

Cites Work

• 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
• Unnamed Item