Generalized fusible numbers and their ordinals
Alexander I. Bufetov, Gabriel Nivasch, Fedor Pakhomov

TL;DR
This paper generalizes fusible numbers to higher dimensions, establishing their order types as functions of the Veblen hierarchy, and explores the impact of different functions on the complexity of generated well-ordered sets.
Contribution
It introduces a family of generalized fusible sets with explicitly determined order types and analyzes how various functions influence their ordinal complexity.
Findings
Generalized sets have order type 4a0; 4a0; 4a0;
Linear functions produce sets with order type at most 4a0;
Certain continuous functions can approach the small Veblen ordinal.
Abstract
Erickson defined the fusible numbers as a set of reals generated by repeated application of the function . Erickson, Nivasch, and Xu showed that is well ordered, with order type . They also investigated a recursively defined function . They showed that the set of points of discontinuity of is a subset of of order type . They also showed that, although is a total function on , the fact that the restriction of to is total is not provable in first-order Peano arithmetic . In this paper we explore the problem (raised by Friedman) of whether similar approaches can yield well-ordered sets of larger order types. As Friedman pointed out, Kruskal's tree theorem yields an upper bound of the small Veblen ordinal for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBenford’s Law and Fraud Detection · Computability, Logic, AI Algorithms · Mathematical and Theoretical Analysis
