Well rewrite orderings and well quasi-orderings - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1991

Well rewrite orderings and well quasi-orderings

Pierre Lescanne
  • Function : Author


This paper studies well (quasi) orderings described as rewrite orderings and proposes a new family of well (quasi) orderings that extends the embedding or divisibility order of G. Higman. For instance, the well (quasi) orderings proposed in this paper may contain pairs of the form f(f(x)) > f(g(f(x))). Conditions under which the transitive closure of a well-founded rewrite relation is a well-quasi-rodering are given. Finally, an attempt to extend the recursive path ordering is proposed.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1385.pdf (969.44 Ko) Télécharger le fichier

Dates and versions

inria-00075176 , version 1 (24-05-2006)


  • HAL Id : inria-00075176 , version 1


Pierre Lescanne. Well rewrite orderings and well quasi-orderings. [Research Report] RR-1385, INRIA. 1991. ⟨inria-00075176⟩
41 View
58 Download


Gmail Facebook Twitter LinkedIn More