Publisher
Springer International Publishing
Reference22 articles.
1. Anglès-D’Auriac, P.E.: Infinite Computations in Algorithmic Randomness and Reverse Mathematics. Université Paris-Est. Ph.D. Thesis (2020)
2. Blass, A.: Some questions arising from Hindman’s theorem. Scientiae Mathematicae Japonicae 62, 331–334 (2005)
3. Blass, A.R., Hirst, J.L., Simpson, S.G.: Logical analysis of some theorems of combinatorics and topological dynamics. In: Logic and Combinatorics. Contemporary Mathematics, vol. 65, pp. 125–156. American Mathematical Society, Providence, RI (1987)
4. Carlucci, L.: A weak variant of Hindman’s theorem stronger than Hilbert’s theorem. Arch. Math. Logic 57, 381–389 (2018)
5. Carlucci, L.: Weak yet strong restrictions of Hindman’s finite sums theorem. Proc. Am. Math. Soc. 146, 819–829 (2018)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献