Title :
Well rewrite orderings
Author :
Lescanne, Pierre
Author_Institution :
Centre de Recherche en Inf. de Nancy, Vandoeuvre-les-Nancy, France
Abstract :
A study is made of well (quasi) orderings which are described as rewrite orderings, and a family of well (quasi) orderings that extends the embedding or divisibility order of G. Higman (1952) is presented. For instance, the well (quasi) orderings proposed by the author may contain pairs of the form f(f(x))>f (g(f(x))). Conditions under which the transitive closures of a well-founded relation is a well-quasi-ordering are given. Finally, an attempt to extend the recursive path ordering is proposed
Keywords :
rewriting systems; divisibility order; embedding; quasi orderings; recursive path ordering; transitive closures; well rewrite orderings; Computer science;
Conference_Titel :
Logic in Computer Science, 1990. LICS '90, Proceedings., Fifth Annual IEEE Symposium on e
Conference_Location :
Philadelphia, PA
Print_ISBN :
0-8186-2073-0
DOI :
10.1109/LICS.1990.113751
