Encoding the hydra battle as a rewrite system

  • Hélène Touzet
Contributed Papers Rewriting
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1450)


In rewriting theory, termination of a rewrite system by Kruskal's theorem implies a theoretical upper bound on the complexity of the system. This bound is, however, far from having been reached by known examples of rewrite systems. All known orderings used to establish termination by Kruskal's theorem yield a multiply recursive bound. Furthermore, the study of the order types of such orderings suggests that the class of multiple recursive functions constitutes the least upper bound. Contradicting this intuition, we construct here a rewrite system which reduces by Kruskal's theorem and whose complexity is not multiply recursive. This system is even totally terminating. This leads to a new lower bound for the complexity of totally terminating rewrite systems and rewrite systems which reduce by Kruskal's theorem. Our construction relies on the Hydra battle using classical tools from ordinal theory and subrecursive functions.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    E.A. Cichon, A short proof of two recently discovered independence results using recursion theoretic methods. Proceedings of the American Mathematical Society, vol 97 (1983), p.704–706.MathSciNetCrossRefGoogle Scholar
  2. 2.
    E.A. Cichon, Termination proofs and complexity characterisations. Proof theory, P. Aczel, H. Simmons and S. Wainer Eds, Cambridge university press (1992), p.173–193.Google Scholar
  3. 3.
    N. Dershowitz and J.P. Jouannaud, Rewrite systems. Handbook of Theoretical Computer Science, J. Van Leeuwen Ed., north-Holland 1990, p.243–320.Google Scholar
  4. 4.
    M.C.F. Ferreira and H. Zantema, Total termination of term rewriting. Proceedings of RTA-93, Lecture Notes in Computer Science 690, p. 213–227.Google Scholar
  5. 5.
    D. Hofbauer, Termination proofs with multiset path orderings imply primitive recursive derivation lengths. Theoretical Computer Science 105-1 (1992), p.129–140.MathSciNetCrossRefGoogle Scholar
  6. 6.
    D. Hofbauer, Termination proofs and derivation lengths in term rewriting systems Dissertation, Technische Universität Berlin, 1991 (also available as Technical Report: TU Berlin, Forschungsberichte des Fachbereichs Informatik 92-46, 1992).Google Scholar
  7. 7.
    L. Kirby and J. Paris, Accessible independence results for Peano arithmetic. Bull. London Math. Soc. 14 (1982), p.285–225.MATHMathSciNetGoogle Scholar
  8. 8.
    J.W. Robbin, Subrecursive Hierarchies. Ph.D. PrincetonGoogle Scholar
  9. 9.
    D. Schmidt, Well-partial orderings and their maximal order types. Habilitationsschrift, Fakultät für Mathematik der Ruprecht-Karl-Universität, Heidelberg (1977).Google Scholar
  10. 10.
    S.S. Wainer, Ordinal recursion, and a refinement of the extented Grzegorczyk hierarchy. Journal of Symbolic Logic 37-2 (1972), p.281–292.MathSciNetGoogle Scholar
  11. 11.
    A. Weiermann, Termination proofs by lexicographic path orderings yield multiply recursive derivation lengths. Theoretical Computer Science 139 (1995), p.355–362.MATHMathSciNetCrossRefGoogle Scholar
  12. 12.
    A. Weiermann, Complexity bounds for some finite forms of Kruskal's theorem. Journal of Symbolic Computation 18 (1994), p.463–488.MATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Hélène Touzet
    • 1
  1. 1.Loria - Université Nancy 2Vandœuvre-lès-NancyFrance

Personalised recommendations