Diamond embeddings into the enumeration degrees

DOI10.1017/S0960129510000216zbMath1220.03041OpenAlexW2093499799MaRDI QIDQ3060191

Andrea Sorbi, Yue Yang, Guohua Wu

Publication date: 1 December 2010

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129510000216

zbMATH Keywords

enumeration degreediamond lattice

Mathematics Subject Classification ID

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

Related Items (1)

INITIAL SEGMENTS OF THE ENUMERATION DEGREES

Cites Work

• Branching in the enumeration degrees of the \(\Sigma_2^0\) sets
• High Minimal Pairs in the Enumeration Degrees
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• Embedding the diamond in the Σ₂ enumeration degrees
• Some Special Pairs of Σ2 e-Degrees
• Embedding finite lattices into the Σ₂⁰ enumeration degrees
• On minimal pairs of enumeration degrees
• Lower Bounds for Pairs of Recursively Enumerable Degrees

This page was built for publication: Diamond embeddings into the enumeration degrees