1. Enumeration reducibility using bounded information: Counting minimal covers;Cooper;Z. Math. Logik Grundlag. Math.,1987
2. Enumeration reducibility, nondeterministic computations and relative computability of partial functions;Cooper,1990
3. C.S. Copestake, Enumeration degrees of Σ20-sets, Ph.D. Thesis, Department of Pure Mathematics, University of Leeds, 1987
4. The n-rea enumeration degrees are dense;Lachlan;Arch. Math. Logic,1992
5. Jumps of quasiminimal enumeration degrees;McEvoy;J. Symbolic Logic,1985