1. Alaev, P.E., Thurber, J., Frolov, A.N.: Computability on linear orderings enriched with predicates. Algebra Logic 48(5), 313–320 (2009)
2. Ash, C.J., Knight, J.: Computable structures and the hyperarithmetical hierarchy. In: Studies in Logic and the Foundations of Mathematics, vol. 144. North-Holland, Amsterdam (2000)
3. Downey, R., Jockusch, C.G.: Every low Boolean algebra is isomorphic to a recursive one. Proc. Am. Math. Soc. 122(3), 871–880 (1994)
4. Harris, K., Montalbán, A.: Boolean Algebra Approximations. (Submitted for publication)
5. Harris, K., Montalbán, A.: On the n-back-and-forth types of Boolean algebras. Trans. Am. Math. Soc. (to appear)