1. Ash, C.J.: Generalizations of enumeration reducibility using recursive infinitary propositional senetences. Ann. Pure Appl. Logic 58, 173–184 (1992)
2. Cooper, S.B.: Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense. J. Symb. Logic 49, 503–513 (1984)
3. Cooper, S.B.: Computability Theory. Chapman & Hall/CRC, Boca Raton (2004)
4. Ganchev, H.: A jump inversion theorem for the infinite enumeration jump. Ann. Sofia Univ ( to appear, 2005)
5. Lecture Notes in Computer Science;H. Ganchev,2007