On restricted forms of enumeration reducibility
From MaRDI portal
Publication:1814011
DOI10.1016/0168-0072(90)90051-3zbMath0751.03021MaRDI QIDQ1814011
Publication date: 25 June 1992
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-0072(90)90051-3
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
Strong enumeration reducibilities, The structure of the s-degrees contained within a single e-degree, s-Degrees within e-Degrees
Cites Work
- Unnamed Item
- e- and s-degrees
- Note on Degrees of Partial Functions
- Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense
- Jumps of quasi-minimal enumeration degrees
- Enumeration Reducibility Using Bounded Information: Counting Minimal Covers
- Reducibility and Completeness for Sets of Integers
- On minimal pairs of enumeration degrees