{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T03:39:01Z","timestamp":1776483541041,"version":"3.51.2"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T00:00:00Z","timestamp":1773100800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T00:00:00Z","timestamp":1773100800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100007161","name":"Secretar\u00eda de Investigaci\u00f3n y Posgrado, Instituto Polit\u00e9cnico Nacional","doi-asserted-by":"publisher","award":["20221862"],"award-info":[{"award-number":["20221862"]}],"id":[{"id":"10.13039\/501100007161","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003141","name":"Secretar\u00eda de Ciencia, Humanidades, Tecnolog\u00eda e Innovaci\u00f3n","doi-asserted-by":"crossref","award":["CBF2023-2024-334"],"award-info":[{"award-number":["CBF2023-2024-334"]}],"id":[{"id":"10.13039\/501100003141","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s00153-026-01004-8","type":"journal-article","created":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T09:52:33Z","timestamp":1773136353000},"page":"451-463","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The adjacent Hindman\u2019s Theorem and the $$\\mathbb Z$$-Ramsey\u2019s Theorem"],"prefix":"10.1007","volume":"65","author":[{"given":"Bruno Fernando","family":"Aceves-Mart\u00ednez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8084-055X","authenticated-orcid":false,"given":"David J.","family":"Fern\u00e1ndez-Bret\u00f3n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L. F.","family":"Romero-Garc\u00eda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis F.","family":"Villag\u00f3mez-Canela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,10]]},"reference":[{"key":"1004_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1090\/conm\/065\/891245","volume":"65","author":"AR Blass","year":"1987","unstructured":"Blass, A.R., Hirst, J.L., Simpson, S.G.: Logical analysis of some theorems of combinatorics and topological dynamics. Contemp. Math. 65, 125\u2013156 (1987)","journal-title":"Contemp. Math."},{"key":"1004_CR2","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s00153-017-0576-1","volume":"57","author":"L Carlucci","year":"2018","unstructured":"Carlucci, L.: A weak variant of Hindman\u2019s Theorem stronger than Hilbert\u2019s theorem. Arch. Math. Logic 57, 381\u2013389 (2018)","journal-title":"Arch. Math. Logic"},{"key":"1004_CR3","doi-asserted-by":"crossref","unstructured":"Carlucci, L.: Restrictions of Hindman\u2019s Theorem: An Overview. In: De Mol L. et al. (Eds.), \u201cConnecting with Computability\u201d, Proceedings of CiE2021, LNCS 12813, pp. 94\u2013105","DOI":"10.1007\/978-3-030-80049-9_9"},{"key":"1004_CR4","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s00153-023-00901-6","volume":"63","author":"L Carlucci","year":"2024","unstructured":"Carlucci, L., Mainardi, L.: Regressive versions of Hindman\u2019s theorem. Arch. Math. Logic 63, 447\u2013472 (2024)","journal-title":"Arch. Math. Logic"},{"key":"1004_CR5","doi-asserted-by":"publisher","first-page":"253","DOI":"10.3233\/COM-180094","volume":"8","author":"BF Csima","year":"2018","unstructured":"Csima, B.F., Dzhafarov, D.D., Hirschfeldt, D.R., Jockusch, K.G., Jr., Solomon, R., Brown Westrick, L.: The reverse mathematics of Hindman\u2019s Theorem for sums of exactly two elements. Computability 8, 253\u2013263 (2018)","journal-title":"Computability"},{"key":"1004_CR6","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s00153-008-0108-0","volume":"48","author":"DD Dzhafarov","year":"2009","unstructured":"Dzhafarov, D.D., Hirst, J.L.: The polarized Ramsey\u2019s theorem. Arch. Math. Logic 48, 141\u2013157 (2009)","journal-title":"Arch. Math. Logic"},{"key":"1004_CR7","volume-title":"Reverse Mathematics. Reductions, and Proofs. Theory and Applications of Computability","author":"DD Dzhafarov","year":"2022","unstructured":"Dzhafarov, D.D., Mummert, C.: Reverse Mathematics. Reductions, and Proofs. Theory and Applications of Computability. Springer (2022)"},{"key":"1004_CR8","doi-asserted-by":"crossref","unstructured":"Carlucci, L., Ko\u0142odziejczyk, L.A., Lepore, F., Zdanowski, K.: New Bounds on the Strength of Some Restrictions of Hindman\u2019s Theorem. In: Kari, J., Manea, F., Petre, I. (eds.), \u201cUnveiling Dynamics and Complexity. 13th Conference on Computability in Europe, CiE 2017.\u201d Springer, (2017), pp. 210\u2013220","DOI":"10.1007\/978-3-319-58741-7_21"},{"key":"1004_CR9","doi-asserted-by":"crossref","unstructured":"Hirschfeldt, D.R.: Slicing the Truth. On the Computable and Reverse Mathematics of Combinatorial Principles. Lecture Note Series 28. Institute for Mathematical Sciences, National University of Singapore, (2015)","DOI":"10.1142\/9208"},{"key":"1004_CR10","doi-asserted-by":"publisher","first-page":"268","DOI":"10.2307\/2272972","volume":"37","author":"CG Jockusch Jr","year":"1972","unstructured":"Jockusch, C.G., Jr.: Ramsey\u2019s Theorem and recursion theory. J. Symbolic Logic 37, 268\u2013280 (1972)","journal-title":"J. Symbolic Logic"},{"key":"1004_CR11","doi-asserted-by":"publisher","first-page":"1309","DOI":"10.1090\/S0002-9947-07-04390-5","volume":"360","author":"JR Mileti","year":"2008","unstructured":"Mileti, J.R.: The Canonical Ramsey Theorem and Computability Theory. Trans. Amer. Math. Soc. 360, 1309\u20131340 (2008)","journal-title":"Trans. Amer. Math. Soc."},{"key":"1004_CR12","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1016\/0097-3165(75)90039-4","volume":"18","author":"KR Milliken","year":"1975","unstructured":"Milliken, K.R.: Ramsey\u2019s Theorem with Sums or Unions. J. Combin. Theory Ser. A 18, 276\u2013290 (1975)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"3","key":"1004_CR13","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1215\/00294527-3839090","volume":"58","author":"O Petrenko","year":"2017","unstructured":"Petrenko, O., Protasov, I.: Selective and Ramsey Ultrafilters on $$G$$-spaces. Notre Dame J. Form. Log. 58(3), 453\u2013459 (2017)","journal-title":"Notre Dame J. Form. Log."},{"key":"1004_CR14","doi-asserted-by":"crossref","unstructured":"Simpson, S.G.: Subsystems of Second Order Arithmetic. Second Edition. Perspectives in Logic, ASL, Cambridge University Press, (2009)","DOI":"10.1017\/CBO9780511581007"},{"key":"1004_CR15","unstructured":"Tavernelli, D.: On the strength of restrictions of Hindman\u2019s theorem. Master\u2019s Degree (Corso di Laurea Magistrale) Thesis, Sapienza Universit\u00e1 di Roma, (2018)"},{"key":"1004_CR16","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0097-3165(76)90058-3","volume":"21","author":"AD Taylor","year":"1976","unstructured":"Taylor, A.D.: A Canonical Partition Relation for Finite Subsets of $$\\omega $$. J. Combin. Theory Ser. A 21, 137\u2013146 (1976)","journal-title":"J. Combin. Theory Ser. A"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-026-01004-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00153-026-01004-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-026-01004-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T02:39:35Z","timestamp":1776479975000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00153-026-01004-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,10]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["1004"],"URL":"https:\/\/doi.org\/10.1007\/s00153-026-01004-8","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,10]]},"assertion":[{"value":"20 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 February 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}