arXiv 1502.037092015-02math.LO

The weakness of being cohesive, thin or free in reverse mathematics

Ludovic Patey

备注：: 31 pages

英文摘要：

Informally, a mathematical statement is robust if its strength is left unchanged under variations of the statement. In this paper, we investigate the lack of robustness of Ramsey's theorem and its consequence under the frameworks of reverse mathematics and computable reducibility. To this end, we study the degrees of unsolvability of cohesive sets for different uniformly computable sequence of sets and identify different layers of unsolvability. This analysis enables us to answer some questions of Wang about how typical sets help computing cohesive sets. We also study the impact of the number of colors in the computable reducibility between coloring statements. In particular, we strengthen the proof by Dzhafarov that cohesiveness does not strongly reduce to stable Ramsey's theorem for pairs, revealing the combinatorial nature of this non-reducibility and prove that whenever $k$ is greater than $\ell$, stable Ramsey's theorem for $n$-tuples and $k$ colors is not computably reducible to Ramsey's theorem for $n$-tuples and $\ell$ colors. In this sense, Ramsey's theorem is not robust with respect to his number of colors over computable reducibility. Finally, we separate the thin set and free set theorem from Ramsey's theorem for pairs and identify an infinite decreasing hierarchy of thin set theorems in reverse mathematics. This shows that in reverse mathematics, the strength of Ramsey's theorem is very sensitive to the number of colors in the output set. In particular, it enables us to answer several related questions asked by Cholak, Giusto, Hirst and Jockusch.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

典型性的弱点

The weakness of typicality

University of Connecticut（康涅狄格大学）；Université de Bordeaux（波尔多大学）；Institut de Mathématiques de Jussieu-Paris Rive Gauche（巴黎左岸苏邦数学研究所）；Université Paris Cité（巴黎西岱大学）；School of Mathematics University of Leeds（利兹大学数学学院）；Penn State University（宾夕法尼亚州立大学）

该研究针对反推数学中的问题，开发涵盖测度与概型的典型性框架，分类反推数学动物园中的问题，发现极弱问题也无典型解。

2026-09-02math.LO

Dominating the Erdos-Moser theorem in reverse mathematics

The Erdos-Moser theorem (EM) states that every infinite tournament has an infinite transitive subtournament. This principle plays an important role in the understanding of the computational strength of Ramsey's theorem for pairs (RT^2_2) by providing an alternate proof of RT^2_2 in terms of EM and the ascending descending sequence principle (ADS). In this paper, we study the computational weakness of EM and construct a standard model (omega-model) of simultaneously EM, weak König's lemma and the cohesiveness principle, which is not a model of the atomic model theorem. This separation answers a…

2016-10-24math.LO

内聚回避与算术集

Cohesive avoidance and arithmetical sets

逆向数学中的一个开放性问题是内聚原理$\COH$是否隐含在$\RCA$的$ω$ -模型中的拉姆齐对定理$\SRT^2_2$的稳定形式中。建立这种含义的一种典型方法是证明对于$ω$子集的每个序列$\vec{R}$，存在一个集合$A$，它是$\vec{R}$中的$Δ^0_2$，使得$A$或$\bar{A}$的每个无限子集计算一个$\vec{R}$ -内聚集合。在这篇文章中，即使在不太严格的假设下，这也是错误的：对于所有的自然数$n \geq 2$和$m < 2^n$，存在一个$ω$子集的序列$\vec{R} = \sequence{R_0,...,R_{n-1}}$，使得对于$\vec{R}$中的$ω$算术的任何分区$A_0,...,A_{m-1}$，存在一个$A_j$的无限子集，该子集不计算$\vec{R}$的凝聚集。这补充了一些以前的结果在可计算性理论的计算能力弱的无限集合的号码与规定的组合性质。证明是一个强制参数使用的适应方法的Seetapun表明，每一个有限着色对整数有一个无限的齐次集不计算一个给定的不可计算集。

2012-12-04math.LO

算术归约下 Erdős-Moser 定理的弱性

The weakness of the Erdős-Moser theorem under arithmetic reductions

本文研究 Erdős-Moser 定理在算术层谱下的计算复杂性，证明其 Δ⁰_n 实例具有 low_{n+1} 解，且非算术集合在相对化解中仍保持非算术性，并给出逐层精细化结果。

2023-10-27math.LO

Controlling iterated jumps of solutions to combinatorial problems

Among the Ramsey-type hierarchies, namely, Ramsey's theorem, the free set, the thin set and the rainbow Ramsey theorem, only Ramsey's theorem is known to collapse in reverse mathematics. A promising approach to show the strictness of the hierarchies would be to prove that every computable instance at level n has a low_n solution. In particular, this requires effective control of iterations of the Turing jump. In this paper, we design some variants of Mathias forcing to construct solutions to cohesiveness, the Erdos-Moser theorem and stable Ramsey's theorem for pairs, while controlling their it…

2016-01-19math.LO

在实分析中避免逻辑强度

Avoiding logical strength in real analysis

University of Würzburg（维尔茨堡大学）；University of Bath（巴斯大学）；University of the Bundeswehr Munich（慕尼黑联邦国防军大学）

本文通过使用慢Cauchy序列，展示了实分析中大部分内容可在比RCA₀保守的理论中发展，挑战了传统逻辑强度划分。

2026-05-14math.LO

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

The reverse mathematics of the Thin set and Erdős-Moser theorems

The thin set theorem for $n$-tuples and $k$ colors ($\mathsf{TS}^n_k$) states that every $k$-coloring of $[\mathbb{N}]^n$ admits an infinite set of integers $H$ such that $[H]^n$ avoids at least one color. In this paper, we study the combinatorial weakness of the thin set theorem in reverse mathematics by proving neither $\mathsf{TS}^n_k$, nor the free set theorem ($\mathsf{FS}^n$) imply the Erdős-Moser theorem ($\mathsf{EM}$) whenever $k$ is sufficiently large (answering a question of Patey and giving a partial result towards a question of Cholak Giusto, Hirst and Jockusch). Given a problem $…

2021-11-16math.LO

关于有界算术和有界集合论的解释

On interpretations of bounded arithmetic and bounded set theory

在最近的一篇论文中，Kaye和Wong证明了下面的结果，他们认为这个结果属于数理逻辑的民间传说。定理：皮亚诺算术和ZF的一阶理论在无穷大公理被否定的情况下是双向可解释的：也就是说，它们是相互可解释的，解释彼此相反。在这份说明中，我描述了一个理论的集合，站在相同的关系，有界算术IDelta0 + exp。由于这种集合论的弱点，我不能直接采用Kaye和Wong在集合论中对算术的解释。相反，我不得不做出不同的解释。

2008-08-17math.LO

一种侧重于交流与可访问性的正式数学新方法

An Alternative Approach to Formal Mathematics that Focuses on Communication and Accessibility

McMaster University（麦克马斯特大学）

本文提出一种新的正式数学方法，旨在解决传统方法在交流和可访问性方面的不足，通过Alonzo逻辑实现，鼓励数学界开发支持该方法的工具和资源。

2026-07-08cs.LOmath.LO

Ramsey-like theorems和immunities

Ramsey-like theorems and immunities

本文研究Ramsey-like定理的计算复杂性，证明其非计算平凡性，并探讨不同免疫概念下的定理特性。

2026-05-11math.LO

Weaker cousins of Ramsey's theorem over a weak base theory

The paper is devoted to a reverse-mathematical study of some well-known consequences of Ramsey's theorem for pairs, focused on the chain-antichain principle $\mathsf{CAC}$, the ascending-descending sequence principle $\mathsf{ADS}$, and the Cohesive Ramsey Theorem for pairs $\mathsf{CRT}^2_2$. We study these principles over the base theory $\mathsf{RCA}^*_0$, which is weaker than the usual base theory $\mathsf{RCA}_0$ considered in reverse mathematics in that it allows only $Δ^0_1$-induction as opposed to $Σ^0_1$-induction. In $\mathsf{RCA}^*_0$, it may happen that an unbounded subset of $\mat…

2021-05-24math.LO

Relationships between computability-theoretic properties of problems

A problem is a multivalued function from a set of \emph{instances} to a set of \emph{solutions}. We consider only instances and solutions coded by sets of integers. A problem admits preservation of some computability-theoretic weakness property if every computable instance of the problem admits a solution relative to which the property holds. For example, cone avoidance is the ability, given a non-computable set $A$ and a computable instance of a problem $\mathsf{P}$, to find a solution relative to which $A$ is still non-computable. In this article, we compare relativized versions of computabi…

2019-03-11math.LO