2025/11/14 by Gabriele Buriola, Buriola, Gabriele, Andreas Weiermann +1 · 1 citation
Computer Science · #03B30 #03F35 #05C05 #06A07 #Advanced Algebra and Logic #Computability, Logic, AI Algorithms #FOS: Mathematics #Logic (math.LO) #Logic, programming, and type systems
paper · pdf · doi:10.48550/arxiv.2511.11297
openalex publication_date 2025/11/14 · openalex created_date 2025/11/18 · openalex updated_date 2026/07/28
Higman's lemma and Kruskal's theorem are two of the most celebrated results in the theory of well quasi-orders. In his seminal paper G. Higman obtained what is known as Higman's lemma as a corollary of a more general theorem, dubbed here Higman's theorem. While the lemma deals with finite sequences over a well quasi-order, the theorem is about abstract operations of arbitrary high arity. J.B. Kruskal was fully aware of this broader framework: in his seminal paper, he not only applied Higman's lemma at crucial points of his proof but also followed Higman's proof schema. At the conclusion of the paper, Kruskal noted that Higman's theorem is a special case, restricted to trees of finite degree, of his own tree theorem. Although he provided no formal reduction, he included a glossary translating concepts between the tree and algebraic settings. The equivalence between these versions was later clarified by D. Schmidt and M. Pouzet. In this work, we revisit that equivalence to illuminate the proof-theoretical relationships between the two theorems within the base system RCA0, of reverse mathematics. Moreover, some independence results over first- and second-orders are treated. In particular, tree-like structures, involving either Ackermannian terms or exponential expressions, are studied unveiling well-foundedness properties that are independent from Peano arithmetic and relevant fragments of second-order arithmetic.