Partial degrees and the density problem
From MaRDI portal
Publication:4749831
DOI10.2307/2273104zbMath0511.03019MaRDI 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
partial functions; Turing reducibility; minimal cover; enumeration degrees; density of partial degrees
03D30: Other degrees and reducibilities in computability and recursion theory
03D45: Theory of numerations, effectively presented structures
Related Items
The minimal e-degree problem in fragments of Peano arithmetic, Strong enumeration reducibilities, On some filters and ideals of the Medvedev lattice, Goodness in the enumeration and singleton degrees, Degrees of denumerability reducibilities, The \(n\)-rea enumeration degrees are dense, Sets of generator and automorphism bases for the enumeration degrees, Quasi-minimal enumeration degrees and minimal Turing degrees, There exists a maximal 3-c.e. enumeration degree, Cupping Classes of $\Sigma^0_2$ Enumeration Degrees, Cupping Δ20 enumeration degrees to 0e′
Cites Work