Calculating Maximal Order Types for Finite Rooted Unstructured Labeled Trees

Diana Schmidt (), Jeroen van der Meeren () and Andreas Weiermann ()
Additional contact information
Diana Schmidt: Hochschule Heilbronn
Jeroen van der Meeren: Gent Universitet, VakgroepWiskunde
Andreas Weiermann: Gent Universitet, VakgroepWiskunde

Chapter Chapter 14 in The Legacy of Kurt Schütte, 2020, pp 253-264 from Springer

Abstract: 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.

Date: 2020
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-030-49424-7_14

Ordering information: This item can be ordered from
http://www.springer.com/9783030494247

DOI: 10.1007/978-3-030-49424-7_14

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().