1. [1] Anderson, B., and B. F. Csima. “A bounded jump for the bounded Turing degrees,” Notre Dame Journal of Formal Logic, vol. 55 (2014), pp. 245–64.
2. [2] Anderson, B., B. F. Csima, and K. M. Lange, “Bounded low and high sets,” Archive for Mathematical Logic, vol. 56 (2017), pp. 507–21.
3. [3] Csima, B. F., R. Downey, and K. M. Ng, “Limits on jump inversion for strong reducibilities,” Journal of Symbolic Logic, vol. 76 (2011), pp. 1287–96.
4. [4] Downey, R., and N. Greenberg, “A hierarchy of computably enumerable degrees,” Bulletin of Symbolic Logic, vol. 24 (2018), pp. 53–89.
5. [5] Downey, R., and N. Greenberg, A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability, vol. 385 of Annals of Mathematics Studies, Princeton University Press, Princeton, NJ, 2020.