Andreas Weiermann. Complexity bounds for some finite forms of Kruskal's Theorem. Journal of Symbolic Computation, vol. 18 (1994), pp. 463–448. -
Andreas Weiermann. Termination proofs for term rewriting systems with lexicographic path ordering imply multiply recursive derivation lengths. Theoretical Computer Science, vol. 139 (1995), pp. 355–362. -
Andreas Weiermann. Bounding derivation lengths with functions from the slow growing hierarchy. Archive of Mathematical Logic, vol. 37 (1998), pp. 427–441.
1981 ◽
pp. 432-447
◽
Keyword(s):
2001 ◽
pp. 485-498
◽
2005 ◽
Vol 5
(3)
◽
pp. 395-399
◽
Keyword(s):
1995 ◽
Vol 139
(1-2)
◽
pp. 355-362
◽
1998 ◽
Vol 208
(1-2)
◽
pp. 87-110
◽
2002 ◽
Vol 13
(06)
◽
pp. 873-887