1. D. Scott, “Logic with denumerably long formulas and finite strings of quantifiers,” In: The Theory of Models. Proc. 1963 Int. Symp. Berkeley, pp. 329-341, North-Holland, Amsterdam (1965).
2. C. J. Ash and J. F. Knight, Computable Structures and the Hyperarithmetical Hierarchy, Elsevier, Amsterdam (2000).
3. A. Montalbán, Computable Structure Theory, Part II: Beyond the Arithmetic [Submitted for publication in 2022].
4. M. Vanden Boom, “The effective Borel hierarchy,” Fundam. Math. 195, No. 3, 269–289 (2007).
5. E. G. K. Lopez-Escobar, “An interpolation theorem for denumerably long formulas,” Fundam. Math. 57, 253–272 (1965).