1. [1] Ash, C. J., and J. Knight, Computable Structures and the Hyperarithmetical Hierarchy, vol. 144of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 2000.
2. [2] Baleva, V., “The jump operation for structure degrees,” Archive for Mathematical Logic, vol. 45 (2006), pp. 249–65.
3. [3] Downey, R., and C. G. Jockusch, “Every low Boolean algebra is isomorphic to a recursive one,” Proceedings of the American Mathematical Society, vol. 122 (1994), pp. 871–80.
4. [4] Frolov, A. N., “$\Delta^{0}_{2}$-copies of linear orderings,” Algebra Logic, vol. 45 (2006), pp. 201–9.
5. [5] Harris, K., and A. Montalbán, “On the $n$-back-and-forth types of Boolean algebras,” Transactions of the American Mathematical Society, vol. 364 (2012), pp. 827–66.