Leanest quasi-orderings preliminary version

Nachum Dershowitz*, E. Castedo Ellerman

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review


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 desired traits. Unfortunately, a minimum in terms of set inclusion can be non-existent even when an intuitive "minimum" exists. We suggest an alternative to set inclusion, called "leanness", show that leanness is a partial ordering of quasi-orderings, and provide sufficient conditions for the existence of a "leanest" ordering.

Original languageEnglish
Pages (from-to)32-45
Number of pages14
JournalLecture Notes in Computer Science
StatePublished - 2005
Event16th International Conference on Term Rewriting and Applications, RTA 2005 - Nara, Japan
Duration: 19 Apr 200521 Apr 2005


Dive into the research topics of 'Leanest quasi-orderings preliminary version'. Together they form a unique fingerprint.

Cite this