Enumeration 1-genericity in the local enumeration degrees
From MaRDI portal
Publication:1633891
DOI10.1215/00294527-2018-0008zbMath1455.03054OpenAlexW2517982670WikidataQ129088577 ScholiaQ129088577MaRDI QIDQ1633891
Charles M. Harris, Liliana Badillo, Mariya Ivanova Soskova
Publication date: 21 December 2018
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.ndjfl/1539396032
Other degrees and reducibilities in computability and recursion theory (03D30) Other Turing degree structures (03D28)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- A note on the enumeration degrees of 1-generic sets
- Goodness in the enumeration and singleton degrees
- The \(n\)-rea enumeration degrees are dense
- INITIAL SEGMENTS OF THE ENUMERATION DEGREES
- An Application of 1-Genericity in the $\Pi^0_2$ Enumeration Degrees
- s-Degrees within e-Degrees
- Jumps of quasi-minimal enumeration degrees
- 1-genericity in the enumeration degrees
- Properly Σ2 Enumeration Degrees
- Reducibility and Completeness for Sets of Integers
- Some Special Pairs of Σ2 e-Degrees
- On minimal pairs of enumeration degrees
- Bounding nonsplitting enumeration degrees
- Semirecursive Sets and Positive Reducibility
- Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets
This page was built for publication: Enumeration 1-genericity in the local enumeration degrees