Abstract
In this article we introduce the notion of a generalized system of fundamental sequences and we define its associated slow-growing hierarchy. We claim that these concepts are genuinely related to the classification of the complexity—the derivation length— of rewrite systems for which termination is provable by a standard termination ordering. To substantiate this claim, we re-obtain multiple recursive bounds on the the derivation length for rewrite systems terminating under lexicographic path ordering, originally established by the second author.
Supported by a Marie Curie fellowship, grant number HPMF-CT-2002-015777.
Supported as a Heisenberg fellow of the DFG.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge Univeristy Press, 1998.
H. Bachmann. Transfinite Zahlen. Springer Verlag, 1955.
W. Buchholz. Proof-theoretical analysis of termination proofs. APAL, 75:57–65, 1995.
W. Buchholz. Ordinal notations and fundamental sequences. Unpublished manuscript; availabe at http://www.mathematik.uni-muenchen.de/~buchholz/, 2003.
E.A. Cichon. Termination orderings and complexity characterisations. In P. Aczel, H. Simmons, and S.S. Wainer, editors, Proof Theory, pages 171–193, 1992.
E.A. Cichon and S.S. Wainer. The slow-growing and the Grzegorczyk hierachies. J. Symbolic Logic, 48:399–408, 1983.
N. Dershowitz and M. Okada. Proof-Theoretic Techniques for Term Rewriting Theory. In LICS 1998, pages 104–111, 1988.
J.-Y. Girard. II 12 -logic I:Dilators. Annals of Mathematical Logic, 21:75–219, 1981.
D. Hofbauer. Termination proofs by multiset path orderings imply primitive recursive derivation lengths. TCS, 105:129–140, 1992.
I. Lepper. Derivation lengths and order types of Knuth-Bendix order. Theoretical Computer Science, 269:433–450, 2001.
I. Lepper. Simply terminating rewrite systems with long derivations. Archive for Mathematical Logic, 2003. To appear. http://www.math.uni-muenster.de-/logik/publ/pre/3.html.
R. Péter. Recursive Functions. Academic Press, 1967.
J.W. Robbin. Subrecursive Hierarchies. PhD thesis, Princeton University, 1965.
D. Schmidt. Well-partial orderings and their maximal order types. Fakultät für Mathematik der Ruprecht-Karl-Universität Heidelberg, 1979. Habilitationsschrift.
Kurt Schütte. Proof Theory. Springer Verlag, Berlin and New York, 1977.
H. Touzet. Encoding the Hydra battle as a rewrite system. In MFCS 1998, LNCS 1450, pages 267–276. Springer Verlag, 1998.
A. Weiermann. Termination proofs for term rewriting systems with lexicographic path ordering imply multiply recursive derivation lengths. TCS, 139:355–362, 1995.
A. Weiermann. Some interesting connections between the slow growing hierarchy and the Ackermann function. J. Symbolic Logic, pages 609–628, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moser, G., Weiermann, A. (2003). Relating Derivation Lengths with the Slow-Growing Hierarchy Directly. In: Nieuwenhuis, R. (eds) Rewriting Techniques and Applications. RTA 2003. Lecture Notes in Computer Science, vol 2706. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44881-0_21
Download citation
DOI: https://doi.org/10.1007/3-540-44881-0_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40254-1
Online ISBN: 978-3-540-44881-5
eBook Packages: Springer Book Archive