A note on the enumeration degrees of 1-generic sets

DOI10.1007/s00153-015-0471-6zbMath1388.03041OpenAlexW2293711125MaRDI QIDQ283105

Hristo Ganchev, Liliana Badillo, Andrea Sorbi, Thomas F. Kent, Caterina Bianchini

Publication date: 13 May 2016

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

Full work available at URL: https://doi.org/10.1007/s00153-015-0471-6

zbMATH Keywords

1-generic setdownwards closed degreese-degreeenumeration degrees

Mathematics Subject Classification ID

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

Related Items (1)

Enumeration 1-genericity in the local enumeration degrees

Cites Work

• Enumeration 1-genericity in the local enumeration degrees
• The recursively enumerable degrees are dense
• An Application of 1-Genericity in the $\Pi^0_2$ Enumeration Degrees
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• The degrees below a 1-generic degree < 0′
• 1-genericity in the enumeration degrees
• Some applications of the notions of forcing and generic sets
• Bounding nonsplitting enumeration degrees
• Some applications of forcing to hierarchy problems in arithmetic
• Enumeration reducibility and partial degrees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the enumeration degrees of 1-generic sets