Encoding the Hydra battle as a rewrite system - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1998

Encoding the Hydra battle as a rewrite system


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 {\em 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 reduce 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 to rewrite systems that reduces by Kruskal's theorem. Our construction relies on the Hydra battle using classical tools from ordinal theory and subrecursive functions. It can be extended to exhaust the provably total functions of Peano arithmetic.


Other [cs.OH]
No file

Dates and versions

inria-00098575 , version 1 (25-09-2006)


  • HAL Id : inria-00098575 , version 1


Hélène Touzet. Encoding the Hydra battle as a rewrite system. International Symposium on the Mathematical Foundations of Computer Science - MFCS'98, Aug 1998, Brno, Czech Republic, pp.267-276. ⟨inria-00098575⟩
141 View
0 Download


Gmail Facebook Twitter LinkedIn More