1. Berardi, S., Oliva, P., & Steila, S. (2015). An analysis of the Podelski–Rybalchenko termination theorem via bar recursion. Journal of Logic and Computation, 24.
2. Berardi, S., & Steila, S. (2015). An intuitionistic version of Ramsey’s Theorem and its use in Program Termination. Annals of Pure and Applied Logic, 166(12), 1382–1406.
3. Figueira, D., Figueira, S., Schmitz, S., & Schnoebelen, P. (2011). Ackermannian and primitive-recursive bounds with Dickson’s Lemma. In LICS 2011: Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science (pp. 269–278). IEEE Press.
4. Gasarch, W. I. (2015). Proving programs terminate using well-founded orderings, Ramsey’s Theorem, and matrices. Advances in Computers, 97, 147–200.
5. Hájek, P., & Pudlák, P. (1998). Chapter II: fragments and combinatorics. Perspectives in Mathematical Logic (Vol. 3, pp. 111–144). Springer, Berlin.