Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths
1995 ◽
Vol 139
(1-2)
◽
pp. 355-362
◽
2001 ◽
pp. 485-498
◽
1981 ◽
pp. 432-447
◽
Keyword(s):
1998 ◽
Vol 208
(1-2)
◽
pp. 87-110
◽
2002 ◽
Vol 13
(06)
◽
pp. 873-887
Keyword(s):
1987 ◽
Vol 49
(1)
◽
pp. 43-79
◽
Keyword(s):