Partial degrees and the density problem
From MaRDI portal
Publication:4749831
DOI10.2307/2273104zbMath0511.03019OpenAlexW2110883968MaRDI QIDQ4749831
Publication date: 1982
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2273104
Other degrees and reducibilities in computability and recursion theory (03D30) Theory of numerations, effectively presented structures (03D45)
Related Items
Degrees of denumerability reducibilities, There exists a maximal 3-c.e. enumeration degree, Strong enumeration reducibilities, Cupping Classes of $\Sigma^0_2$ Enumeration Degrees, On some filters and ideals of the Medvedev lattice, The \(n\)-rea enumeration degrees are dense, The minimal e-degree problem in fragments of Peano arithmetic, Goodness in the enumeration and singleton degrees, Cupping Δ20 enumeration degrees to 0e′, Quasi-minimal enumeration degrees and minimal Turing degrees, Sets of generator and automorphism bases for the enumeration degrees
Cites Work