1. Orderings for term-rewriting systems;Dershowitz;Theor. Comput. Sci,1982
2. G. Higman. Ordering by divisibility in abstract algebras. Proc. London Mathematical Society, 2:326–336, 1952.
3. Well-quasiordering finite trees with gap-condition. Proof of Harvey Friedman's conjecture;Kříž;Ann. of Math,1989
4. Well-quasiordering, the Tree Theorem, and Vazsonyi's conjecture;Kruskal;Trans. American Mathematical Society,1960
5. On the theory of quasi-ordinal diagrams;Okada;Logic and Combinatorics (Arcata, CA, 1985), Contemp. Math., vol. 65, Amer. Math. Soc., Providence, RI,1987