Well-foundedness of term orderings

Abstract

WeU-foundedncss is the essential property of orderings for proving termination. We introduce a simple criterion on term orderings such that any term ordering possessing the subterm property and satisfying this criterion is wen-founded. The usual path orders fulfil this criterion, yielding a much simpler proof of well-foundedness than the classical proof depending on Kruskal's theorem. Even more, our approach covers non-simplification orders like spo and gpo which can not be dealt with by Kruskal's theorem. For finite alphabets we present completeness results, i. e., a term rewriting system terminates if and only if it is compatible with an order satisfying the criterion. For infinite alphabets the same completeness results hold for a slightly different criterion.