• DocumentCode
    2717176
  • Title

    Well rewrite orderings

  • Author

    Lescanne, Pierre

  • Author_Institution
    Centre de Recherche en Inf. de Nancy, Vandoeuvre-les-Nancy, France
  • fYear
    1990
  • fDate
    4-7 Jun 1990
  • Firstpage
    249
  • Lastpage
    256
  • 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;
  • fLanguage
    English
  • Publisher
    ieee
  • 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
  • Type

    conf

  • DOI
    10.1109/LICS.1990.113751
  • Filename
    113751
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2717176