Generalized fusible numbers and their ordinals

Erickson defined the fusible numbers as a set F of reals generated by repeated application of the function [Formula presented]. Erickson, Nivasch, and Xu showed that F is well ordered, with order type ε₀. They also investigated a recursively defined function M:R→R. They showed that the set of points of discontinuity of M is a subset of F of order type ε₀. They also showed that, although M is a total function on R, the fact that the restriction of M to Q is total is not provable in first-order Peano arithmetic PA. In this paper we explore the problem (raised by Friedman) of whether similar approaches can yield well-ordered sets F of larger order types. As Friedman pointed out, Kruskal's tree theorem yields an upper bound of the small Veblen ordinal for the order type of any set generated in a similar way by repeated application of a monotone function g:Rⁿ→R. The most straightforward generalization of [Formula presented] to an n-ary function is the function [Formula presented]. We show that this function generates a set F_n whose order type is just φ_n−1(0). For this, we develop recursively defined functions M_n:R→R naturally generalizing the function M. Furthermore, we prove that for any linear function g:Rⁿ→R, the order type of the resulting F is at most φ_n−1(0). Finally, we show that there do exist continuous functions g:Rⁿ→R for which the order types of the resulting sets F approach the small Veblen ordinal.