Hyperations, Veblen progressions and transfinite iteration of ordinal functions (Q385073)

The authors build transfinite hierarchies of functions that refine hierarchies built in the manner of \textit{O. Veblen} [Trans. Am. Math. Soc. 9, 280--292 (1908; JFM 39.0102.01)]. The new sequences have the advantage of preserving normality at limits. Additionally, if an initial function \(f\) has a well-behaved left inverse, then a sequence of similar inverses can be found for the entire hierarchy generated by \(f\).