Abstract
Diana Schmidt, in her Habilitationsschrift in 1979, completely classified the maximal order types of the natural tree embeddability relations for finite rooted structured labeled trees. Her results since have found interesting applications in proof theory and reverse mathematics. The question concerning the maximal order types of unstructured trees has been left open for years, and a conclusive answer will be given in this article. Moreover, we provide an answer to a question of Harvey Friedman regarding Γ0 and binary two-labeled unstructured trees.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. N. Crossley and J. Bridge Kister. Natural well-orderings. Archiv für mathematische Logik und Grundlagenforschung, 26:57–76, 1986/7.
D. H. J. de Jongh and R. Parikh. Well partial orderings and hierarchies. Indigationes Mathematicae, 39:195–206, 1977.
S. Feferman. Systems of predicative analysis. II. Representations of ordinals. Journal of Symbolic Logic, 33:193–220, 1968.
S. Feferman. Proof theory: A personal report. In G. Takeuti, editor, Proof theory, volume 81, pages 447–485. North-Holland Publishing Co., Amsterdam, second edition, 1987.
S. Feferman. Three conceptual problems that bug me, 1996. https://math.stanford.edu/˜feferman/papers/conceptualprobs.pdf.
G. Higman. Ordering by divisibility in abstract algebras. Proceedings of the London Mathematical Society, 3(2):326–336, 1952.
J. Kruskal. Well-quasi-ordering, the tree theorem, and Vázsonyi’s conjecture. Transactions of the American Mathematical Society, 95:210–225, 1960.
D. Schmidt. Bound for the closure ordinals for replete monotonic increasing functions. Journal of Symbolic Logic, 40:305–316, 1975.
D. Schmidt. Well-partial Orderings and their Maximal Order Types. Habilitationsschrift, Heidelberg, 1979.
K. Schütte. Kennzeichnung von Ordnungszahlen durch rekursiv erklärte Funktionen. Mathematische Annalen, 127:15–32, 1954.
K. Schütte. Proof Theory. Springer, 1977.
S. G. Simpson. Nonprovability of certain combinatorial properties of finite trees. In H. Friedman’s Research on the Foundations of Mathematics, volume 117 of Stud. Logic Found. Math., pages 87–117. North-Holland, Amsterdam, 1985.
F. van Vugt. Independence of Variations to Kruskal’s Theorem in ACA0. Thesis written under supervision of A. Weiermann, Utrecht, 2005.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Schmidt, D., van der Meeren, J., Weiermann, A. (2020). Calculating Maximal Order Types for Finite Rooted Unstructured Labeled Trees. In: Kahle, R., Rathjen, M. (eds) The Legacy of Kurt Schütte. Springer, Cham. https://doi.org/10.1007/978-3-030-49424-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-030-49424-7_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-49423-0
Online ISBN: 978-3-030-49424-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)