1. Lecture Notes in Computer Science;AM Ben-Amram,2002
2. Codish, M., Genaim, S.: Proving termination one loop at a time. In: Mesnard, F., Serebrenik, A. (eds.) Proceedings of the 13th International Workshop on Logic Programming Environments, Tata Institute of Fundamental Research, Mumbai, India, 8 December 2003. Report, vol. CW371, pp. 48–59. Katholieke Universiteit Leuven, Department of Computer Science, Celestijnenlaan 200A, B-3001 Heverlee (Belgium) (2003)
3. Friedman, H.: Some systems of second order arithmetic and their use. In: Proceedings of the International Congress of Mathematicians (Vancouver, B.C., 1974), vol. 1, pp. 235–242 (1975)
4. Gasarch, W.: Chapter four - proving programs terminate using well-founded orderings, Ramsey’s Theorem, and Matrices. Adv. Comput. 97, 147–200 (2015)
5. Hájek, P., Pudlák, P.: Metamathematics of First-Order Arithmetic. Perspectives in Mathematical Logic, vol. 3. Springer, Berlin (1998)