Minimal bad sequences are necessary for a uniform Kruskal theorem

DOI10.1016/j.aim.2022.108265OpenAlexW2999820809WikidataQ113880990 ScholiaQ113880990MaRDI QIDQ2125990

Michael Rathjen, Andreas Weiermann, Anton Freund

Publication date: 14 April 2022

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2001.06380

zbMATH Keywords

reverse mathematics independence results recursive path ordering Kruskal's theorem minimal bad sequence dilators on partial orders

Mathematics Subject Classification ID

Trees (05C05) Combinatorics of partially ordered sets (06A07) Grammars and rewriting systems (68Q42) Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35)

Related Items (2)

Well ordering principles for iterated \(\Pi^1_1\)-comprehension ⋮ Bachmann-Howard derivatives

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
An order-theoretic characterization of the Howard-Bachmann-hierarchy
Orderings for term-rewriting systems
On well-quasi-ordering finite structures with labels
Harvey Friedman's research on the foundations of mathematics
Proof-theoretic investigations on Kruskal's theorem
Derivatives of normal functions in reverse mathematics
Well-partial-orderings and the big Veblen number
\(\Pi_1^1\)-comprehension as a well-ordering principle
Ordinal notation systems corresponding to Friedman's linearized well-partial-orders with gap-condition
Introduction to \(\Pi^1_2\)-logic
On the lengths of bad sequences of monomial ideals over polynomial rings
On principles between ∑1- and ∑2-induction, and monotone enumerations
Well-Partial Orderings and their Maximal Order Types
A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets
Ordinal numbers and the Hilbert basis theorem
Π12-logic, Part 1: Dilators
From Kruskal’s theorem to Friedman’s gap condition
PREDICATIVE COLLAPSING PRINCIPLES
Computable aspects of the Bachmann–Howard principle
HOW STRONG ARE SINGLE FIXED POINTS OF NORMAL FUNCTIONS?
A categorical construction of Bachmann–Howard fixed points
Reverse mathematics and the equivalence of definitions for well and better quasi-orders
Systems of predicative analysis
Eine Grenze Für die Beweisbarkeit der Transfiniten Induktion in der Verzweigten Typenlogik
Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
Ordering by Divisibility in Abstract Algebras
Two applications of analytic functors
A note on ordinal exponentiation and derivatives of normal functions

This page was built for publication: Minimal bad sequences are necessary for a uniform Kruskal theorem