首页/论文/2003.02714

arXiv 2003.027142020-03-05math.LOcs.DMmath.CO

From Kruskal's theorem to Friedman's gap condition

Anton Freund

英文摘要：

Harvey Friedman's gap condition on embeddings of finite labelled trees plays an important role in combinatorics (proof of the graph minor theorem) and mathematical logic (strong independence results). In the present paper we show that the gap condition can be reconstructed from a small number of well-motivated building blocks: it arises via iterated applications of a uniform Kruskal theorem.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

一致 Kruskal-Friedman 定理的逆向数学

Reverse mathematics of a uniform Kruskal-Friedman theorem

本文研究一致 Kruskal-Friedman 定理的逆向数学，证明其在基础理论 $\mathsf{RCA_0}$ 上等价于 $Π^1_1$-超限递归与 Kříž 的最小坏序列原理，揭示了无穷在有限组合学中的作用。

2022-02-23math.LO

Minimal bad sequences are necessary for a uniform Kruskal theorem

The minimal bad sequence argument due to Nash-Williams is a powerful tool in combinatorics with important implications for theoretical computer science. In particular, it yields a very elegant proof of Kruskal's theorem. At the same time, it is known that Kruskal's theorem does not require the full strength of the minimal bad sequence argument. This claim can be made precise in the framework of reverse mathematics, where the existence of minimal bad sequences is equivalent to a principle known as $Π^1_1$-comprehension, which is much stronger than Kruskal's theorem. In the present paper we give…

2020-01-17cs.LOmath.COmath.LO

Analysis of a Double Kruskal Theorem

The strength of an extension of Kruskal's Theorem to certain pairs of cohabitation trees is calibrated.

2016-03-07math.LO

The uniform Kruskal theorem: between finite combinatorics and strong set existence

The uniform Kruskal theorem extends the original result for trees to general recursive data types. As shown by A. Freund, M. Rathjen and A. Weiermann, it is equivalent to $Π^1_1$-comprehension, over $\mathsf{RCA_0}$ with the chain antichain principle ($\mathsf{CAC}$). This result provides a connection between finite combinatorics and abstract set existence. The present paper sheds further light on this connection. First, we show that the original Kruskal theorem is equivalent to the uniform version for data types that are finitely generated. Secondly, we prove a dichotomy result for a natural …

2022-07-30math.LO

RCA$_0$ 上的统一 Kruskal 定理

The uniform Kruskal theorem over RCA$_0$

本文证明统一 Kruskal 定理与 Π^1_1-概括的等价性可直接在 RCA_0 上成立，无需额外假设链反链原理，并通过改进 Girard 对算术概括的序数幂刻画完成证明。

2025-02-06math.LO

Higman定理与Kruskal定理的证明论关系，以及树状结构的独立性结果

Proof-Theoretic Relations between Higman's and Kruskal's theorem, and Independence Results for Tree-like Structures

University of Verona（维罗纳大学）；Ghent University（根特大学）

本文研究Higman定理与Kruskal定理的证明论关系，并探讨树状结构在不同逻辑系统中的独立性结果。

2026-08-31math.LO

更多相关论文收起更多论文

良序原理的序数分析，良quasi序的闭包性质，以及Σ_n-集合 schema

Ordinal Analysis of Well-Ordering Principles, Well Quasi-Orders Closure Properties, and $Σ_n$-Collection Schema

University of Verona（维罗纳大学）；Ghent University（根特大学）

本文通过分析标记Kruskal定理的不同版本，研究了良序原理和良quasi序闭包性质的序数分析，并扩展了集合schema BΣ_n的分析。

2025-12-21math.LO

Impredicativity and Trees with Gap Condition: A Second Course on Ordinal Analysis

These lecture notes introduce central notions of impredicative ordinal analysis, such as the Bachmann-Howard ordinal and the method of collapsing, which transforms uncountable proof trees into countable ones. Specifically, we analyze parameter-free $Π^1_1$-comprehension and show that it cannot prove the extended Kruskal theorem due to Harvey Friedman (not even for two labels). In terms of prerequisites, we build on a previous lecture on the ordinal analysis of Peano arithmetic. The present material is intended for 12 lectures and 6 exercise sessions of 90 minutes each.

2022-08-10math.LO

关于 FGH 定理的一些观察

Some observations on the FGH theorem

本文从经典与模态命题逻辑框架及 Rosser 可证性谓词两个视角研究 FGH 定理，探讨了定理保证的句子形式并证明了相关变体。

2023-04-08math.LO

Phase transition results for three Ramsey-like theorems

We classify a sharp phase transition threshold for Friedman's finite adjacent Ramsey theorem. We extend the method for showing this result to two previously known classifications involving Ramsey theorem variants: the Paris--Harrington theorem and the Kanamori--McAloon theorem. We also provide tools to remove ad-hoc arguments from the proofs of phase transition results as much as currently possible.

2016-03-22math.LO

正规测度的数量，再探

The number of normal measures, revisited

本文提出Friedman-Magidor定理的新版本，通过简单力迫控制可测基数上正规测度的提升数量，不依赖内模型精细结构，并推广至extender情形。

2025-09-09math.LO

A computable analysis of variable words theorems

The Carlson-Simpson lemma is a combinatorial statement occurring in the proof of the Dual Ramsey theorem. Formulated in terms of variable words, it informally asserts that given any finite coloring of the strings, there is an infinite sequence with infinitely many variables such that for every valuation, some specific set of initial segments is homogeneous. Friedman, Simpson, and Montalban asked about its reverse mathematical strength. We study the computability-theoretic properties and the reverse mathematics of this statement, and relate it to the finite union theorem. In particular, we prov…

2018-05-18math.LO

Adjacent Ramsey theory and Higman's lemma

We show a short proof of Higman's lemma using Friedman's adjacent Ramsey theorem for pairs. This provides an alternative proof of the known upper bound for the reverse mathematical status of Higman's lemma and that of its miniaturised version.

2016-02-29math.LO

论 P=NP 要么为假，要么独立于 ZFC

On P=NP Either False or Independent of ZFC

本文基于 Friedman 的 Jump Free Theorem 构造了一个猜想独立于 ZFC 的推论，并论证若该推论独立于 ZFC，则 P=NP 无法在 ZFC 中证明，从而说明 P=NP 可能为假或独立于 ZFC。

2024-03-30math.COmath.LO

Embedding Cohen algebras using pcf theory

Using a theorem from pcf theory, we show that for any singular cardinal nu, the product of the Cohen forcing notions on kappa, kappa < nu adds a generic for the Cohen forcing notion on nu^+. This solves Problem 5.1 in Miller's list (attributed to Rene David and Sy Friedman).

1995-08-15math.LO

Reverse mathematics of the finite downwards closed subsets of $\mathbb{N}^k$ ordered by inclusion and adjacent Ramsey for fixed dimension

We show that the well-partial orderedness of the finite downwards closed subsets of $\mathbb{N}^k$ ,ordered by inclusion, is equivalent to the well-foundedness of the ordinal $ω^{ω^ω}$. This was conjectured to be the case by Hatzikiriakou and Simpson. Since we use Friedman's adjacent Ramsey theorem for fixed dimensions in the upper bound, we also give a treatment of the reverse mathematical status of that theorem.

2017-10-04math.LO

Tanaka's Theorem Revisited

Tanaka (1997) proved a powerful generalization of Friedman's self-embedding theorem that states that given a countable nonstandard model $(\mathcal{M},\mathcal{A})$ of the subsystem $\mathrm{WKL}_{0}$ of second order arithmetic, and any element $m$ of $\mathcal{M}$, there is a self-embedding $j$ of $(\mathcal{M},\mathcal{A})$ onto a proper initial segment of itself such that $j$ fixes every predecessor of $m$. Here we extend Tanaka's work by establishing the following results for a countable nonstandard model $(\mathcal{M},\mathcal{A})$ of $\mathrm{WKL}_{0} $ and a proper cut $\mathrm{I}$ of $…

2018-11-20math.LO