On a duality between Kruskal and Dershowitz theorems

  • Paul-André Melliès
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1443)


The article is mainly concerned with the Kruskal tree theorem and the following observation: there is a duality at the level of binary relations between well and noetherian orders. The first step here is to extend Kruskal theorem from orders to binary relations so that the duality applies. Then, we describe the theorem obtained by duality and show that it corresponds to a theorem by Ferreira and Zantema which subsumes Dershowitz's seminal results on recursive path orderings.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Handbook of Mathematical Logic, edited by J. Barwise, Studies in Logic and Foundations of Computer Science, North-Holland, 1977.Google Scholar
  2. 2.
    N. Dershowitz, “Orderings for term rewriting systems”. Theoretical Computer Science 17, 3, pp.279–301, 1982.MATHMathSciNetCrossRefGoogle Scholar
  3. 3.
    N. Dershowitz, “Termination of rewriting”. Journal of Symbolic Computation 3, 1 and 2, pp.69–116, 1987.MATHMathSciNetGoogle Scholar
  4. 4.
    N. Dershowitz and C. Hoot, “Topics in termination”, in Proceedings of the 5th conference on Rewriting Techniques and Applications, C. Kirchner ed., LNCS 690, Springer, pp.198–212, 1983.Google Scholar
  5. 5.
    A. Ehrenfeucht, D. Hausslet and G. Rozenberg, “On regularity of context-free languages”, Theoretical Computer Science 27 (3), pp.311–332, 1983.MATHMathSciNetCrossRefGoogle Scholar
  6. 6.
    M. C. F. Ferreira and H. Zantema, “Syntactical Analysis of Total Termination”, proceedings of the 4th International Conference on Algebraic and Logic Programming, editors G. Levi and M. Rodrigues-Artalejo, Springer Lecture Notes in Computer Science, volume 850, pages 204–222, 1994.Google Scholar
  7. 7.
    M. C. F Ferreira and H. Zantema, “Well-foundedness of Term Orderings”, in Conditional Term Rewriting Systems, proceedings fourth international workshop CTRS-94, editor N. Dershowitz, Springer Lecture Notes in Computer Science, volume 968, pages 106–123, 1995.Google Scholar
  8. 8.
    G. Higman, “Ordering by divisibility in Abstract Algebra”, Proc. London Math. Soc, 3(2), 326–336, 1952.MathSciNetGoogle Scholar
  9. 9.
    S. Kamin and J. J. Lévy, “Two generalizations of the recursive path ordering”, University of Illinois, 1980.Google Scholar
  10. 10.
    J. B. Kruskal, “Well-quasi-ordering, the tree theorem, and Vázsonyi's conjecture”, Trans. Amer. Math. Soc. 95, pp.210–225, 1960.MATHMathSciNetCrossRefGoogle Scholar
  11. 11.
    P. Lescanne, “Well rewrite orderings”, In Proceedings, Fifth Annual IEEE Symposium on Logic in Computer Science, pages 249–256, Philadelphia, Pennsylvania, 4–7 June 1990. IEEE Computer Society Press.Google Scholar
  12. 12.
    P.-A. Melliès, “Description abstraite des systèmes de réécriture”, Thèse de l'Université Paris VII, Décembre 1996.Google Scholar
  13. 13.
    C. S. L. A. Nash-Williams, “On well-quasi ordering finite trees”, Proceedings Cambridge Phil. Soc. 59, 833–382, 1963.MATHMathSciNetCrossRefGoogle Scholar
  14. 14.
    L. Puel, “Using unavoidable sets of trees to generalize Kruskal's theorem“, Journal of Symbolic Computation 8, 335–382, 1989.MATHMathSciNetCrossRefGoogle Scholar
  15. 15.
    M. Rathjen, A. Weiermann, “Proof-theoretic investigations on Kruskal's theorem”, Annals of Pure and Applied Logic, 60, 1993.Google Scholar
  16. 16.
    C. Thomassen, “Embeddings and Minors”, in Handbook of Combinatorics, Volume 1, R. L. Graham, M. Grötschel, L. Lovász editors, North-Holland, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Paul-André Melliès
    • 1
  1. 1.LFCSUniversity of EdinburghUK

Personalised recommendations