A jump inversion theorem for the infinite enumeration jump
Keywords:
enumeration degrees, enumeration jump, enumeration reducibility, forcingAbstract
In this paper we study partial regular enumerations for arbitrary recursive ordinal. We use the technique to obtain a jump inversion and omitting theorem for the infinite enumeration jump for the case of partial degrees.
Downloads
Published
2008-12-12
How to Cite
Ganchev, H. (2008). A jump inversion theorem for the infinite enumeration jump. Ann. Sofia Univ. Fac. Math. And Inf., 98, 61–85. Retrieved from https://ftl5.uni-sofia.bg./index.php/fmi/article/view/130
Issue
Section
Articles