Coursera Spring Sale
40% Off Coursera Plus Annual!
Grab it
Explore the advanced mathematical theory of better-quasi-orderings through ordinal analysis in this third lecture from a summer school on reverse mathematics. Delve into C. Nash-Williams' concept of better-quasi-ordering (bqo) and its crucial role in R. Laver's proof of Fraïssé's conjecture, examining how this notion strengthens well-foundedness for non-total orders. Investigate the reverse mathematics perspective on bqo theory, discovering why even proving that all finite orders are bqo requires unusually strong axioms such as arithmetical recursion along natural numbers (ACA_0^+). Learn how ordinal analysis provides the only known proof method for this result, connecting G. Gentzen's foundational work on Peano arithmetic's proof-theoretic ordinal epsilon_0 to the analysis of finite better-quasi-orderings. Gain insight into the sophisticated interplay between ordinal analysis techniques and the strength requirements for establishing fundamental properties of better-quasi-orderings in mathematical logic.
