1. Rogers H., Theory of Recursive Functions and Effective Computability, McGraw-Hill Book Comp., New York, St. Louis, San Francisco, Toronto, London, and Sydney (1967).
2. Shore R. A. and Marcone A., “The maximal linear extension theorem in second order arithmetic,” Arch. Math. Logic, vol. 50, no. 5–6, 543–564 (2011).
3. Shore R. A., Marcone A., and Montalbán A., “Computing maximal chains,” Arch. Math. Logic, vol. 51, no. 4, 615–660 (2012).
4. Montalbán A., “Computable linearizations of well-partial-orderings,” Order, vol. 24, no. 1, 39–48 (2007).
5. Shore R. A., Cholak P. A., and Dzhafarov D. D., “Computably enumerable partial orders,” arXiv:1110.4068v1 [math.LO]. 2011. 10 p.