1. P. E. Alaev, A. N. Frolov, and J. Thurber, “Computability on linear orderings enriched with predicates,” Algebra and Logic, 48, No. 5, 313–320 (2009).
2. C. J. Ash and J. Knight, “Computable structures and the hyperarithmetical hierarchy,” in: Studies in Logic and the Foundations of Mathematics, 144. North-Holland Publishing Co., Amsterdam (2000). xvi+346 p.
3. R. J. Coles, R. Downey, and B. Khoussainov, “On initial segments of computable linear orders,” Order, 14, 107–124 (1997/98).
4. R. G. Downey, “On presentations of algebraic structures,” in: Complexity, Logic, and Recursion Theory (A. Sorbi (ed.)), New York, Dekker (1997), pp. 157–205.
5. R. G. Downey, “Computability theory and linear orders,” in: Handbook of Recursive Mathematics (Yu. l. Ershov, S. S. Goncharov, A. Nerode, and J. B. Remmel (eds.)), Vol. 138, Studies in Logic and the Foundations of Mathematics, Chap. 14., Elsevier (1988).