Publisher
Springer Nature Switzerland
Reference12 articles.
1. Cai, M., Ganchev, H.A., Lempp, S., Miller, J.S., Soskova, M.I.: Defining totality in the enumeration degrees, to appear in J. Amer. Math. Soc
2. Cooper, S.B.: Partial degrees and the density problem. Part 2: the enumeration degrees of the $${\varSigma }_2$$ sets are dense. J. Symbolic Logic 49, 503–513 (1984)
3. Friedberg, R.M., Rogers Jr., H.: Reducibility and completeness for sets of integers, Z. Math. Logik Grundlag. Math. 5, 117–125 (1959)
4. Kalimullin, I.S.: Definability of the jump operator in the enumeration degrees. J. Math. Log. 3(2), 257–267 (2003)
5. Nies, A., Shore, R.A., Slaman, T.A.: Definability in the recursively enumerable degrees. Bull. Symbolic Logic 2(4), 392–404 (1996)