Generalized Higman's Theorem and iterated ideals
Fedor Pakhomov, Giovanni Sold\`a

TL;DR
This paper presents a new, explicit proof of Generalized Higman's Theorem using a transfinite hierarchy of orders, formalizable in $ ext{ATR}_0$, resolving a key open problem in reverse mathematics.
Contribution
It introduces a novel proof technique based on an explicit characterization of orders, enabling formalization in $ ext{ATR}_0$ and advancing understanding of better quasi-orders.
Findings
Characterization of bqo via transfinite hierarchy of ideals
Formalization of the proof in $ ext{ATR}_0$
New insights into the structure of iterated ideals
Abstract
Generalized Higman's Theorem is the direct counterpart of Higman's Theorem that asserts the closure of the class of \emph{better} quasi-orders, instead of the class of \emph{well} quasi-orders, under the construction of the embeddability order on finite sequences. Traditionally, this result is obtained as a consequence of very powerful and general techniques of Nash-Williams. In this paper, we propose a new proof of this result that is based on an explicit characterization of the underlying orders. In particular, this new technique allows us to formalize the proof of the result in the formal theory , thus resolving a long-standing open problem in the field of reverse mathematics. The main ingredient of our proof is the introduction of a transfinite hierarchy of orders starting with and $\dot…
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
TopicsComputability, Logic, AI Algorithms · Advanced Topology and Set Theory · Advanced Algebra and Logic
