On the cartesian product of well-orderings
Preprint in arXiv (February 2022)
The most recent citing publication is shown below. View this citation on Dimensions.
Well-Quasi Orders in Computation, Logic, Language and Reasoning
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 1 Well, Better and In-Between
-
Altmetric BadgeChapter 2 On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders
-
Altmetric BadgeChapter 3 The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings
-
Altmetric BadgeChapter 4 Strong WQO Tree Theorems
-
Altmetric BadgeChapter 5 Well Quasi-orderings and Roots of Polynomials in a Hahn Field
-
Altmetric BadgeChapter 6 Upper Bounds on the Graph Minor Theorem
-
Altmetric BadgeChapter 7 Recent Progress on Well-Quasi-ordering Graphs
-
Altmetric BadgeChapter 8 The Reverse Mathematics of wqos and bqos
-
Altmetric BadgeChapter 9 Well Quasi-orders and the Functional Interpretation
-
Altmetric BadgeChapter 10 Well-Quasi Orders and Hierarchy Theory
-
Altmetric BadgeChapter 11 A Combinatorial Bound for a Restricted Form of the Termination Theorem
-
Altmetric BadgeChapter 12 A Mechanized Proof of Higman’s Lemma by Open Induction
-
Altmetric BadgeChapter 13 Well-Partial Orderings and their Maximal Order Types