Provable better quasi orders
Abstract
It has recently been shown that fairly strong axiom systems such as ACA0 cannot prove that the antichain with three elements is a better quasi order (bqo). In the present paper, we give a complete characterization of the finite partial orders that are provably bqo in such axiom systems. The result will also be extended to infinite orders. As an application, we derive that a version of the minimal bad array lemma is weak over ACA0. In sharp contrast, a recent result shows that the same version is equivalent to 12-comprehension over the stronger base theory ATR0.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.