Well-Quasi Orders in Computation, Logic, Language and Reasoning

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Well, Better and In-Between
3. Altmetric Badge
   Chapter 2 On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders
4. Altmetric Badge
   Chapter 3 The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings
5. Altmetric Badge
   Chapter 4 Strong WQO Tree Theorems
6. Altmetric Badge
   Chapter 5 Well Quasi-orderings and Roots of Polynomials in a Hahn Field
7. Altmetric Badge
   Chapter 6 Upper Bounds on the Graph Minor Theorem
8. Altmetric Badge
   Chapter 7 Recent Progress on Well-Quasi-ordering Graphs
9. Altmetric Badge
   Chapter 8 The Reverse Mathematics of wqos and bqos
10. Altmetric Badge
    Chapter 9 Well Quasi-orders and the Functional Interpretation
11. Altmetric Badge
    Chapter 10 Well-Quasi Orders and Hierarchy Theory
12. Altmetric Badge
    Chapter 11 A Combinatorial Bound for a Restricted Form of the Termination Theorem
13. Altmetric Badge
    Chapter 12 A Mechanized Proof of Higman’s Lemma by Open Induction
14. Altmetric Badge
    Chapter 13 Well-Partial Orderings and their Maximal Order Types