Generalized Higman's Theorem and iterated ideals
Abstract
Generalized Higman's Theorem is the direct counterpart of Higman's Theorem that asserts the closure of the class of better quasi-orders, instead of the class of well quasi-orders, under the construction P P<ω 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 atr0, 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 I*α(P) starting with I*0(P)=P and I*α+1(P) being the inclusion order on ideals of I*α(P). On one hand, we show that a quasi-order P is a bqo if and only if all I*α(P) are wqos. On the other hand, under the assumption that P is a bqo, we show that the I*α(P<ω) are wqos, and furthermore give a characterization of their structure in terms of a transfinite iteration of a Higman-like construction. The sufficiently explicit character of this proof allows us to formalize it in a rather straightforward manner.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.