From Kruskal’s theorem to Friedman’s gap condition
From MaRDI portal
Publication:4988429
DOI10.1017/S0960129520000298MaRDI QIDQ4988429
Publication date: 14 May 2021
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.02714
Kruskal's theoremlabelled treesdilators\(\Pi^1_1\)-comprehensionwell partial ordersFriedman's gap condition
Trees (05C05) Combinatorics of partially ordered sets (06A07) Foundations of classical theories (including reverse mathematics) (03B30)
Related Items
Minimal bad sequences are necessary for a uniform Kruskal theorem, Well ordering principles for iterated \(\Pi^1_1\)-comprehension, Fixed points and Noetherian topologies, Bachmann-Howard derivatives, WELL ORDERING PRINCIPLES AND -STATEMENTS: A PILOT STUDY, Counting embeddings of rooted trees into families of rooted trees
Cites Work
- An order-theoretic characterization of the Howard-Bachmann-hierarchy
- Orderings for term-rewriting systems
- Harvey Friedman's research on the foundations of mathematics
- What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
- Proof-theoretic investigations on Kruskal's theorem
- Well-quasiordering finite trees with gap-condition. Proof of Harvey Friedman's conjecture
- The differential lambda-calculus
- 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
- Well-Partial Orderings and their Maximal Order Types
- Generalizations of the Kruskal-Friedman theorems
- Computable aspects of the Bachmann–Howard principle
- A categorical construction of Bachmann–Howard fixed points
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- The Power of Priority Channel Systems
- Two applications of analytic functors
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
