Coursera Spring Sale
40% Off Coursera Plus Annual!
Grab it
Explore the mathematical theory of better-quasi-orderings through ordinal analysis in this 58-minute lecture from the Summer School on "Reverse Mathematics: New Paradigms" at the Erwin Schrödinger International Institute. Discover how better-quasi-orderings (bqos), introduced by C. Nash-Williams, strengthen the concept of well-foundedness for non-total orders and examine their crucial role in R. Laver's proof of Fraïssé's conjecture. Learn why the theory of bqos requires unusually strong axioms in reverse mathematics, where even proving that all finite orders are bqo necessitates at least arithmetical recursion along natural numbers (equivalent to omega-th Turing jumps, forming the theory ACA_0^+). Understand how ordinal analysis provides the only known proof method for this result, connecting G. Gentzen's foundational work showing that Peano arithmetic has proof-theoretic ordinal epsilon_0 to the analysis of finite bqos. Gain insight into the intersection of order theory, reverse mathematics, and proof theory as the lecture demonstrates how these mathematical frameworks combine to establish fundamental results about finite orders.
