An order-theoretic characterization of the Howard-Bachmann-hierarchy
Preprint
Abstract
In this article we provide an intrinsic characterization of the famous Howard-Bachmann ordinal in terms of a natural well-partial-ordering by showing that this ordinal can be realized as a maximal order type of a class of generalized trees with respect to a homeomorphic embeddability relation. We use our calculations to draw some conclusions about some corresponding subsystems of second order arithmetic. All these subsystems deal with versions of light-face $\Pi^1_1$-comprehensionKeywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Well-partial-orderings and the big Veblen numberArchive for Mathematical Logic, 2014
- Reverse mathematics and the equivalence of definitions for well and better quasi-ordersThe Journal of Symbolic Logic, 2004
- Reverse mathematics and rank functions for directed graphsArchive for Mathematical Logic, 2000
- Bar induction and ω model reflectionAnnals of Pure and Applied Logic, 1999
- Reverse mathematics and ordinal exponentiationAnnals of Pure and Applied Logic, 1994
- Bounds for the closure ordinals of essentially monotonic increasing functionsThe Journal of Symbolic Logic, 1993
- Proof-theoretic investigations on Kruskal's theoremAnnals of Pure and Applied Logic, 1993
- Well-partial orderings and hierarchiesIndagationes Mathematicae, 1977
- The theory of well-quasi-ordering: A frequently discovered conceptJournal of Combinatorial Theory, Series A, 1972
- Ordering by Divisibility in Abstract AlgebrasProceedings of the London Mathematical Society, 1952