Calculating Maximal Order Types for Finite Rooted Unstructured Labeled Trees
From MaRDI portal
Publication:5013906
DOI10.1007/978-3-030-49424-7_14zbMath1479.05318OpenAlexW3028272614MaRDI QIDQ5013906
Diana Schmidt, Andreas Weiermann, Jeroen Van der Meeren
Publication date: 3 December 2021
Published in: The Legacy of Kurt Schütte (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-49424-7_14
Cites Work
- Unnamed Item
- Unnamed Item
- Harvey Friedman's research on the foundations of mathematics
- Kennzeichnung von Ordnungszahlen durch rekursiv erklärte Funktionen
- Natural well-orderings
- Bounds for the closure ordinals of replete monotonic increasing functions
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Systems of predicative analysis, II: Representations of ordinals
- Ordering by Divisibility in Abstract Algebras
This page was built for publication: Calculating Maximal Order Types for Finite Rooted Unstructured Labeled Trees