1. Lowness Properties of r.e. Sets;Bickford,1982
2. Minimal pairs and high recursively enumerable degrees;Cooper;J. Symbolic Logic,1974
3. Pseudo-jump inversion, upper cone avoidance, and strong jump-traceability;Downey;Adv. Math.,2013
4. Rod Downey, Noam Greenberg, A transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability, submitted for publication.
5. Algorithmic Randomness and Complexity;Downey,2010