Skip to main content
Conference ProceedingsOPEN ACCESS

Trees, ordinals mad termination

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1993) 668 LNCS 243-250
DOI: 10.1007/3-540-56610-4_68
15Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Dershowitz, N. (1993). Trees, ordinals mad termination. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 668 LNCS, pp. 243–250). Springer Verlag. https://doi.org/10.1007/3-540-56610-4_68

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free