{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T21:44:56Z","timestamp":1773179096014,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319587400","type":"print"},{"value":"9783319587417","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-58741-7_21","type":"book-chapter","created":{"date-parts":[[2017,5,11]],"date-time":"2017-05-11T12:59:28Z","timestamp":1494507568000},"page":"210-220","source":"Crossref","is-referenced-by-count":4,"title":["New Bounds on the Strength of Some Restrictions of Hindman\u2019s Theorem"],"prefix":"10.1007","author":[{"given":"Lorenzo","family":"Carlucci","sequence":"first","affiliation":[]},{"given":"Leszek Aleksander","family":"Ko\u0142odziejczyk","sequence":"additional","affiliation":[]},{"given":"Francesco","family":"Lepore","sequence":"additional","affiliation":[]},{"given":"Konrad","family":"Zdanowski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,12]]},"reference":[{"key":"21_CR1","first-page":"331","volume":"62","author":"A Blass","year":"2005","unstructured":"Blass, A.: Some questions arising from Hindman\u2019s theorem. Sci. Math. Japonicae 62, 331\u2013334 (2005)","journal-title":"Sci. Math. Japonicae"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"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\u2013156. American Mathematical Society, Providence, RI (1987)","DOI":"10.1090\/conm\/065\/891245"},{"key":"21_CR3","unstructured":"Carlucci, L.: A weak variant of Hindman\u2019s Theorem stronger than Hilbert\u2019s Theorem. Preprint (2016). \nhttps:\/\/arxiv.org\/abs\/1610.05445"},{"key":"21_CR4","unstructured":"Carlucci, L.: Weak yet strong restrictions of Hindman\u2019s finite sums theorem. In: Proceedings of the American Mathematical Society. Preprint (2016). \nhttps:\/\/arxiv.org\/abs\/1610.07500\n\n. Accepted with minor revision for publication"},{"key":"21_CR5","unstructured":"Carlucci, L.: Bounded Hindman\u2019s theorem and increasing polarized Ramsey\u2019s theorem. In: Nies, A. (ed.) Logic Blog, Part 4, Section 9 (2016). \nhttps:\/\/arxiv.org\/abs\/1703.01573"},{"issue":"1","key":"21_CR6","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1017\/jsl.2013.27","volume":"79","author":"L Carlucci","year":"2014","unstructured":"Carlucci, L., Zdanowski, K.: The strength of Ramsey\u2019s theorem for coloring relatively large sets. J. Symbolic Logic 79(1), 89\u2013102 (2014)","journal-title":"J. Symbolic Logic"},{"issue":"1","key":"21_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2694910","volume":"66","author":"PA Cholak","year":"2001","unstructured":"Cholak, P.A., Jockusch, C.G., Slaman, T.A.: On the strength of Ramsey\u2019s theorem for pairs. J. Symbolic Logic 66(1), 1\u201355 (2001)","journal-title":"J. Symbolic Logic"},{"key":"21_CR8","doi-asserted-by":"crossref","first-page":"1093","DOI":"10.1090\/S0002-9939-09-10115-6","volume":"138","author":"CT Chong","year":"2010","unstructured":"Chong, C.T., Lempp, S., Yang, Y.: On the role of the collection principle for \n            $$\\varSigma ^0_2$$\n           formulas in second-order reverse mathematics. Proc. Am. Math. Soc. 138, 1093\u20131100 (2010)","journal-title":"Proc. Am. Math. Soc."},{"key":"21_CR9","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1090\/S0894-0347-2014-00789-X","volume":"27","author":"CT Chong","year":"2014","unstructured":"Chong, C.T., Slaman, T.A., Yang, Y.: The metamathematics of the stable Ramsey\u2019s theorem for pairs. J. Am. Math. Soc. 27, 863\u2013892 (2014)","journal-title":"J. Am. Math. Soc."},{"key":"21_CR10","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1090\/S0002-9939-2014-12261-1","volume":"143","author":"DD Dzhafarov","year":"2015","unstructured":"Dzhafarov, D.D.: Cohesive avoidance and strong reductions. Proc. Am. Math. Soc. 143, 869\u2013876 (2015)","journal-title":"Proc. Am. Math. Soc."},{"issue":"2","key":"21_CR11","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s00153-008-0108-0","volume":"48","author":"DD Dzhafarov","year":"2011","unstructured":"Dzhafarov, D.D., Hirst, J.L.: The polarized Ramsey\u2019s theorem. Arch. Math. Logic 48(2), 141\u2013157 (2011)","journal-title":"Arch. Math. Logic"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-319-50062-1_11","volume-title":"Computability and Complexity","author":"DD Dzhafarov","year":"2017","unstructured":"Dzhafarov, D.D., Jockusch, C.G., Solomon, R., Westrick, L.B.: Effectiveness of Hindman\u2019s theorem for bounded sums. In: Day, A., Fellows, M., Greenberg, N., Khoussainov, B., Melnikov, A., Rosamond, F. (eds.) Computability and Complexity. LNCS, vol. 10010, pp. 134\u2013142. Springer, Cham (2017). doi:\n10.1007\/978-3-319-50062-1_11"},{"key":"21_CR13","series-title":"Perspectives in Mathematical Logic","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-22156-3","volume-title":"Metamathematics of First-Order Arithmetic","author":"P H\u00e0jek","year":"1993","unstructured":"H\u00e0jek, P., Pudl\u00e0k, P.: Metamathematics of First-Order Arithmetic. Perspectives in Mathematical Logic. Springer, Heidelberg (1993)"},{"issue":"2","key":"21_CR14","first-page":"341","volume":"36","author":"N Hindman","year":"1972","unstructured":"Hindman, N.: The existence of certain ultrafilters on \n            $$N$$\n           and a conjecture of Graham and Rothschild. Proc. Am. Math. Soc. 36(2), 341\u2013346 (1972)","journal-title":"Proc. Am. Math. Soc."},{"key":"21_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0097-3165(74)90023-5","volume":"17","author":"N Hindman","year":"1974","unstructured":"Hindman, N.: Finite sums from sequences within cells of a partition of N. J. Comb. Theory Ser. A 17, 1\u201311 (1974)","journal-title":"J. Comb. Theory Ser. A"},{"key":"21_CR16","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1017\/S0963548303005716","volume":"12","author":"N Hindman","year":"2003","unstructured":"Hindman, N., Leader, I., Strauss, D.: Open problems in partition regularity. Comb. Probab. Comput. 12, 571\u2013583 (2003)","journal-title":"Comb. Probab. Comput."},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Hirschfeldt, D.R.: Slicing the Truth (On the Computable and Reverse Mathematics of Combinatorial Principles). Lecture Notes Series, vol. 28, Institute for Mathematical Sciences, National University of Singapore (2014)","DOI":"10.1142\/9208"},{"issue":"1\u20132","key":"21_CR18","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s00153-011-0257-4","volume":"51","author":"J Hirst","year":"2012","unstructured":"Hirst, J.: Hilbert vs. Hindman. Arch. Math. Logic 51(1\u20132), 123\u2013125 (2012)","journal-title":"Arch. Math. Logic"},{"issue":"3","key":"21_CR19","doi-asserted-by":"crossref","first-page":"431","DOI":"10.2178\/bsl\/1309952320","volume":"17","author":"A Montalb\u00e1n","year":"2011","unstructured":"Montalb\u00e1n, A.: Open questions in Reverse Mathematics. Bull. Symbolic Logic 17(3), 431\u2013454 (2011)","journal-title":"Bull. Symbolic Logic"},{"key":"21_CR20","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511581007","volume-title":"Subsystems of Second Order Arithmetic","author":"S Simpson","year":"2009","unstructured":"Simpson, S.: Subsystems of Second Order Arithmetic, 2nd edn. Cambridge University Press, New York (2009). Association for Symbolic Logic","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Unveiling Dynamics and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-58741-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,31]],"date-time":"2017-08-31T09:02:47Z","timestamp":1504170167000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-58741-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319587400","9783319587417"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-58741-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}