Normal functions and maximal order types

Abstract

AbstractTransformations of well partial orders induce functions on the ordinals, via the notion of maximal order type. In most examples from the literature, these functions are not normal, in marked contrast with the central role that normal functions play in ordinal analysis and related work from computability theory. The present paper aims to explain this phenomenon. In order to do so, we investigate a rich class of order transformations that are known as $\textsf {WPO}$-dilators. According to a first main result of this paper, $\textsf {WPO}$-dilators induce normal functions when they satisfy a rather restrictive condition, which we call strong normality. Moreover, the reverse implication holds as well, for reasonably well-behaved $\textsf {WPO}$-dilators. Strong normality also allows us to explain another phenomenon: by previous work of Freund, Rathjen and Weiermann, a uniform Kruskal theorem for $\textsf {WPO}$-dilators is as strong as $\varPi ^1_1$-comprehension, while the corresponding result for normal dilators on linear orders is equivalent to the much weaker principle of $\varPi ^1_1$-induction. As our second main result, we show that $\varPi ^1_1$-induction is equivalent to the uniform Kruskal theorem for $\textsf {WPO}$-dilators that are strongly normal.