New Bounds on the Strength of Some Restrictions of Hindman’s Theorem-Reference-Cited by-同舟云学术

New Bounds on the Strength of Some Restrictions of Hindman’s Theorem

Published:2017 Issue: Volume: Page:210-220
ISSN:0302-9743
Container-title:Unveiling Dynamics and Complexity
language:
Short-container-title:

Author:

Carlucci Lorenzo,Kołodziejczyk Leszek Aleksander,Lepore Francesco,Zdanowski Konrad

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-58741-7_21

Reference20 articles.

1. Blass, A.: Some questions arising from Hindman’s theorem. Sci. Math. Japonicae 62, 331–334 (2005)

2. Blass, A.R., Hirst, J.L., Simpson, S.G.: Logical analysis of some theorems of combinatorics and topological dynamics. In: Logic and Combinatorics (Arcata, California, 1985), Contemporary Mathematics, vol. 65, pp. 125–156. American Mathematical Society, Providence, RI (1987)

3. Carlucci, L.: A weak variant of Hindman’s Theorem stronger than Hilbert’s Theorem. Preprint (2016). https://arxiv.org/abs/1610.05445

4. Carlucci, L.: Weak yet strong restrictions of Hindman’s finite sums theorem. In: Proceedings of the American Mathematical Society. Preprint (2016). https://arxiv.org/abs/1610.07500 . Accepted with minor revision for publication

5. Carlucci, L.: Bounded Hindman’s theorem and increasing polarized Ramsey’s theorem. In: Nies, A. (ed.) Logic Blog, Part 4, Section 9 (2016). https://arxiv.org/abs/1703.01573

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Hindman’s theorem for sums along the full binary tree, $$\Sigma ^0_2$$-induction and the Pigeonhole principle for trees;Archive for Mathematical Logic;2022-01-21

2. New bounds on the strength of some restrictions of Hindman’s Theorem;Computability;2020-05-13

3. The reverse mathematics of Hindman’s Theorem for sums of exactly two elements;Computability;2019-09-20

4. A weak variant of Hindman’s Theorem stronger than Hilbert’s Theorem;Archive for Mathematical Logic;2017-07-24