Higman's lemma is stronger for better quasi orders

DOI10.1007/S11083-024-09658-WMaRDI QIDQ6663926zbMATH OpenFDO

Authors Anton Freund

Publication date 15 January 2025

Published in Order (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11083-024-09658-W

zbMATH Keywords

better quasi orderHigman's lemmaNash-Williams' theoremRamsey's theoremreverse mathematics

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Recursive ordinals and ordinal notations (03F15) Second- and higher-order arithmetic and fragments (03F35) Combinatorics of partially ordered sets (06A07)

Recommendations

• On the logical strength of the better quasi order with three elements
• Reverse mathematics and the equivalence of definitions for well and better quasi-orders
• Towards better: a motivated introduction to better-quasi-orders
• scientific article; zbMATH DE number 956479
• scientific article; zbMATH DE number 2085177

Cites work

• Fine analysis of the quasi-orderings on the power set
• scientific article; zbMATH DE number 4172969 (Why is no real title available?)
• scientific article; zbMATH DE number 3946114 (Why is no real title available?)
• scientific article; zbMATH DE number 956479 (Why is no real title available?)
• scientific article; zbMATH DE number 3536056 (Why is no real title available?)
• scientific article; zbMATH DE number 749940 (Why is no real title available?)
• scientific article; zbMATH DE number 3248824 (Why is no real title available?)
• scientific article; zbMATH DE number 2236642 (Why is no real title available?)
• On the logical strength of the better quasi order with three elements
• Open questions in reverse mathematics
• Ordering by Divisibility in Abstract Algebras
• Ordinal analysis and the infinite Ramsey theorem
• Partial well‐ordering of sets of vectors
• Ramsey's theorem and recursion theory
• Subsystems of second order arithmetic
• The Veblen functions for computability theorists

Cited in

(1)

• On the logical strength of the better quasi order with three elements

This page was built for publication: Higman's lemma is stronger for better quasi orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6663926)