论文信息 - Well rewrite orderings

Well rewrite orderings

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.<<ETX>>

Pierre Lescanne | P. Lescanne

[1] James R. Russell,et al. A constructive proof of Higman's lemma , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[2] Pierre Lescanne. Well quasi-ordering in a paper by Maurice Janet , 1989, Bull. EATCS.

[3] J. Kruskal. Well-quasi-ordering, the Tree Theorem, and Vazsonyi’s conjecture , 1960 .

[4] Jean-Pierre Jouannaud,et al. Recursive Decomposition Ordering , 1982, Formal Description of Programming Concepts.

[5] Laurence Puel,et al. Embedding with Patterns and Associated Recursive Path Ordering , 1989, RTA.

[6] Nachum Dershowitz,et al. Termination of Rewriting , 1987, J. Symb. Comput..

[7] Nachum Dershowitz,et al. Orderings for term-rewriting systems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[8] Jean H. Gallier,et al. What's So Special About Kruskal's Theorem and the Ordinal Gamma0? A Survey of Some Results in Proof Theory , 1991, Ann. Pure Appl. Log..

[9] Joseph B. Kruskal,et al. The Theory of Well-Quasi-Ordering: A Frequently Discovered Concept , 1972, J. Comb. Theory A.

[10] Pierre Lescanne,et al. Computer experiments with the REVE term rewriting system generator , 1983, POPL '83.

[11] Graham Higman,et al. Ordering by Divisibility in Abstract Algebras , 1952 .

[12] Laurence Puel,et al. Using Unavoidable Set of Trees to Generalize Kruskal's Theorem , 1989, J. Symb. Comput..