Abstract
Trees are a natural representation for countable ordinals. In particular, finite trees provide a convenient notation the predicative ones. Processes that transform trees or terms can often be proved terminating by viewing the tree or the tree representation of the term as an ordinal.
Research supported in part by the U. S. National Science Foundation under Grants CCR-90-07195 and CCR-90-24271 and by a Meyerhoff fellowship at The Weizmann Institute of Science.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
E. C. Dennis-Jones and S. S. Wainer. Subrecursive hierarchies via direct limits. In M. M. Richter, et al., editors, Computation and Proof Theory: Proceedings of the Logic Colloquium, Part II, pages 117–128, Aachen, 1983. Lecture Notes in Mathematics 1104, Springer-Verlag.
Nachum Dershowitz and Zohar Manna. Proving termination with multiset orderings. Communications of the ACM, 22(8):465–476, August 1979.
Nachum Dershowitz and Edward M. Reingold. Ordinal arithmetic with list expressions. In A. Nerode and M. Taitslin, editors, Proceedings of the Symposium on Logical Foundations of Computer Science, pages 117–126, Tver, Russia, July 1992. Vol. 620 in Lecture Notes in Computer Science, Springer-Verlag, Berlin.
Nachum Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17(3):279–301, March 1982.
Nachum Dershowitz. Termination of rewriting. J. of Symbolic Computation, 3(1&2):69–115, February/April 1987. Corrigendum: 4, 3 (December 1987), 409–410.
Robert W. Floyd. Assigning meanings to programs. In Proceedings of Symposia in Applied Mathematics, XIX: Mathematical Aspects of Computer Science, pages 19–32, Providence, RI, 1967. American Mathematical Society.
Jean Gallier. What's so special about Kruskal's Theorem and the ordinal Γ0. A survey of some results in proof theory. Annals of Pure and Applied Logic, 53(3):199–260, September 1991.
R. Iturriaga. Contributions to mechanical mathematics. Ph.D. Thesis, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, PA, 1967.
Laurie Kirby and Jeff Paris. Accessible independence results for Peano arithmetic. Bulletin London Mathematical Society, 14:285–293, 1982.
Mitsuhiro Okada and Adam Steele. Ordering structures and the Knuth-Bendix completion algorithm. In Proceedings of the Allerton Conference on Communication, Control, and Computing, Monticello, IL, 1988.
Mitsuhiro Okada. Note on a proof of the extended Kirby-Paris game on labeled finite trees. European Journal of Combinatorics, 9:249–253, 1988.
Diana Schmidt. Built-up systems of fundamental sequences and hierarchies of number-theoretic functions. Arch. Math. Logik, 18:47–53, 1976.
Alan M. Turing. Checking a large routine. In Report of a Conference on High Speed Automatic Calculating Machines, pages 67–69, Institute of Computer Science, University of Toronto, Toronto, Ontario, Canada, January 1950.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dershowitz, N. (1993). Trees, ordinals and termination. In: Gaudel, M.C., Jouannaud, J.P. (eds) TAPSOFT'93: Theory and Practice of Software Development. CAAP 1993. Lecture Notes in Computer Science, vol 668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56610-4_68
Download citation
DOI: https://doi.org/10.1007/3-540-56610-4_68
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56610-6
Online ISBN: 978-3-540-47598-9
eBook Packages: Springer Book Archive