1. On pairs of recursively enumerable degrees;Ambos-Spies;Trans. Am. Math. Soc.,1984
2. K. Ambos-Spies, N. Losert, 2019, Universally array noncomputable sets.
3. Computable Structures and the Hyperarithmetical Hierarchy;Ash,2000
4. Rings of sets;Birkhoff;Duke Math. J.,1937
5. A Hierarchy of Turing Degrees: A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability (AMS-206);Downey,2020