Minimal generalized computable enumerations and high degrees
- 24 Downloads
We establish that the set of minimal generalized computable enumerations of every infinite family computable with respect to a high oracle is effectively infinite. We find some sufficient condition for enumerations of the infinite families computable with respect to high oracles under which there exist minimal generalized computable enumerations that are irreducible to the enumerations.
Keywordsgeneralized computable enumeration minimal enumeration high set Low2 set arithmetic enumeration
Unable to display preview. Download preview PDF.
- 9.Faizrahmanov M. Kh., “Universal generalized computable numerations and hyperimmunity,” Algebra and Logic (to be published).Google Scholar