1. R. I. Soare, Recursively Enumerable Sets and Degrees (Springer-Verlag, Berlin, 1987; Kazan Math. Soc., Kazan, 2000).
2. R. G. Downey, Computability Theory and Linear Orderings. Handbook of Computable Algebra (Elsevier, Amsterdam, 1998), Vol. 2, pp. 823–976.
3. J. Rosenstein, Linear Orderings (Academic Press, New York, 1982).
4. S. Fellner, “Recursive and Finite Axiomatizability of Linear Orderings,” Ph. D. Thesis (Rutgers. Univ., 1976).
5. M. Lerman, “On Recursive Linear Orderings,” Lect. Notes Math. 859, 132–142 (1981).