Generalized Higman's Theorem and iterated ideals

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Pakhomov, Fedor, Soldà, Giovanni
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866917133020037120
author Pakhomov, Fedor
Soldà, Giovanni
author_facet Pakhomov, Fedor
Soldà, Giovanni
contents 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 $P\mapsto 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 $\mathsf{atr}_0$, 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 $\dot I^*_α(P)$ starting with $\dot I^*_0(P)=P$ and $\dot I^*_{α+1}(P)$ being the inclusion order on ideals of $\dot I^*_α(P)$. On one hand, we show that a quasi-order $P$ is a bqo if and only if all $\dot I^*_α(P)$ are wqos. On the other hand, under the assumption that $P$ is a bqo, we show that the $\dot 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.
format Preprint
id arxiv_https___arxiv_org_abs_2512_07685
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Generalized Higman's Theorem and iterated ideals
Pakhomov, Fedor
Soldà, Giovanni
Logic
03B30 (Primary), 06A06 (Secondary)
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 $P\mapsto 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 $\mathsf{atr}_0$, 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 $\dot I^*_α(P)$ starting with $\dot I^*_0(P)=P$ and $\dot I^*_{α+1}(P)$ being the inclusion order on ideals of $\dot I^*_α(P)$. On one hand, we show that a quasi-order $P$ is a bqo if and only if all $\dot I^*_α(P)$ are wqos. On the other hand, under the assumption that $P$ is a bqo, we show that the $\dot 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.
title Generalized Higman's Theorem and iterated ideals
topic Logic
03B30 (Primary), 06A06 (Secondary)
url https://arxiv.org/abs/2512.07685