RTA
2005
Springer
14 years 5 months ago
2005
Springer
A convenient method for defining a quasi-ordering, such as those used for proving termination of rewriting, is to choose the minimum of a set of quasi-orderings satisfying some d...