1. Downey, R., “Computability theory and linear orderings,” pp. 823–976 in Handbook of Recursive Mathematics, vol. 2, edited by Yu. L. Ershov, S. S. Goncharov, A. Nerode, J. B. Remmel, and V. W. Marek, Elsevier, New York, 1998. Zbl 0941.03045 MR 2000j:03059
2. Ehrenfeucht, A., “An application of games to the completeness problem for formalized theories,” Fundamenta Mathematicæ, vol. 49 (1961), pp. 129–41. Zbl 0096.24303 MR 23:A3666
3. Fraïssé, R., “Sur quelques classifications des systèmes de relations,” Publications in Science and Universal Algebra, series A, vol. 1 (1954), pp. 35–182. Zbl 0068.24302 MR 16,1005h
4. Fröhlich, A., and J. C. Shepherdson, “Effective procedures in field theory,” Philosophical Transactions of the Royal Society of London, series A, vol. 248 (1955), pp. 407–32. Zbl 0070.03502 MR 17,570d
5. Moses, M., “Relations intrinsically recursive in linear orders,” Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 32 (1986), pp. 467–72. Zbl 0596.03038 MR 87k:03047