ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS

DOI10.1142/S0219061305000432zbMath1097.03036MaRDI QIDQ3379460

Andrea Sorbi, Steffen Lempp, Theodore A. Slaman

Publication date: 6 April 2006

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

zbMATH Keywords

partial orderextensions of embeddingsenumeration degrees\(\Sigma_2\)-theory\(\Sigma^0_2\)-sets\(K\)-r.e. setse-reducibility

Mathematics Subject Classification ID

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

Related Items

Extensions of two constructions of Ahmad ⋮ Enumeration Reducibility and Computable Structure Theory ⋮ Interpreting true arithmetic in the -enumeration degrees ⋮ Fragments of the theory of the enumeration degrees ⋮ INITIAL SEGMENTS OF THE ENUMERATION DEGREES ⋮ The Π₃-theory of the -enumeration degrees is undecidable

Cites Work

• Unnamed Item
• Generic copies of countable structures
• The d.r.e. degrees are not dense
• The \(n\)-rea enumeration degrees are dense
• Definability in the enumeration degrees
• The recursively enumerable degrees are dense
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• Some Special Pairs of Σ2 e-Degrees
• On minimal pairs of enumeration degrees
• Sublattices of the Recursively Enumerable Degrees