1. Ash, C.J., Jockush, C., Knight, J.F.: Jumps of orderings. Trans. Amer. Math. Soc. 319, 573–599 (1990)
2. Coles, R., Downey, R., Slaman, T.: Every set has a least jump enumeration. Bulletin London Math. Soc 62, 641–649 (2000)
3. Cooper, S.B.: Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ
2 sets are dense. J. Symbolic Logic 49, 503–513 (1984)
4. Downey, R.G., Knight, J.F.: Orderings with αth jump degree 0(α). Proc. Amer. Math. Soc. 114, 545–552 (1992)
5. Gavryushkin, A.N.: On complexity of Ehrenfeucht Theories with computable model. In: Beckmann, A., Berger, U., Löwe, B., Tucker, J. (eds.) Logical Approaches to Computational barriers CiE2006, University of Wales Swansea, Report Series, No. CSR 7-2006, pp. 105–108 (2006)