1. Cooper S.B.: Enumeration reducibility using bounded information: counting minimal covers. Z. Math. Logik Grundlag. Math. 33, 537–560 (1987)
2. Cooper S.B.: Enumeration reducibility, nondeterministic computations and relative computability of partial functions. In: Ambos-Spies, K., Müller, G., Sacks, G.E. (eds) Recursion Theory Week, Oberwolfach 1989, vol. 1432 of Lecture Notes in Mathematics, pp. 57–110. Springer, Heidelberg (1990)
3. Cooper S.B.: Computability Theory. Chapman & Hall/CRC Mathematics, Boca Raton, London, New York, Washington, DC (2003)
4. Harris C.M.: Goodness in the enumeration and singleton degrees. Arch. Math. Log. 18(6), 673–691 (2010)
5. Kent T.F.: The structure of the s-degrees contained within a single e-degree. Ann. Pure Appl. Log. 160(1), 13–21 (2009)