arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1603.08249math.LO
收藏

Hindman定理对有界和的有效性

Effectiveness of Hindman's theorem for bounded sums

Damir D. Dzhafarov, Carl G. Jockusch,, Reed Solomon, Linda Brown Westrick

摘要:

我们考虑的强度和有效内容的限制版本的Hindman定理,其中的颜色的数量是指定的和的长度有一个指定的有限界。令$\mathsf{HT}^{\leq n}_k$表示对于$\mathbb{N}$的每个$k$着色$c$存在无限集合$X \subseteq \mathbb{N}$使得$F \subseteq X$和$0 < |F| \leq n$的所有和$\sum_{x \in F} x$具有相同颜色的断言。证明了存在$\mathbb{N}$的可计算$2$ -着色$c$使得不存在无限可计算集合$X$使得$X$的至多$2$元素的所有非空和具有相同的颜色.由此可见,$\mathsf{HT}^{\leq 2}_2$是不可证明的$\mathsf{RCA}_0$,事实上,我们表明,它意味着$\mathsf{SRT}^2_2$在$\mathsf{RCA}_0$。我们还表明,有一个可计算的实例$\mathsf{HT}^{\leq 3}_3$的所有解决方案计算$0'$。这个结果的证明表明,$\mathsf{HT}^{\leq 3}_3$在$\mathsf{RCA}_0$中蕴涵$\mathsf{ACA}_0$。

英文摘要:

We consider the strength and effective content of restricted versions of Hindman's Theorem in which the number of colors is specified and the length of the sums has a specified finite bound. Let $\mathsf{HT}^{\leq n}_k$ denote the assertion that for each $k$-coloring $c$ of $\mathbb{N}$ there is an infinite set $X \subseteq \mathbb{N}$ such that all sums $\sum_{x \in F} x$ for $F \subseteq X$ and $0 < |F| \leq n$ have the same color. We prove that there is a computable $2$-coloring $c$ of $\mathbb{N}$ such that there is no infinite computable set $X$ such that all nonempty sums of at most $2$ elements of $X$ have the same color. It follows that $\mathsf{HT}^{\leq 2}_2$ is not provable in $\mathsf{RCA}_0$ and in fact we show that it implies $\mathsf{SRT}^2_2$ in $\mathsf{RCA}_0$. We also show that there is a computable instance of $\mathsf{HT}^{\leq 3}_3$ with all solutions computing $0'$. The proof of this result shows that $\mathsf{HT}^{\leq 3}_3$ implies $\mathsf{ACA}_0$ in $\mathsf{RCA}_0$.

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

↑