{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:22:57Z","timestamp":1740108177018,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2017,4,21]],"date-time":"2017-04-21T00:00:00Z","timestamp":1492732800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"John Templeton Foundation (US)","award":["48003"],"award-info":[{"award-number":["48003"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s00153-017-0536-9","type":"journal-article","created":{"date-parts":[[2017,4,21]],"date-time":"2017-04-21T04:58:00Z","timestamp":1492750680000},"page":"491-506","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The reverse mathematics of non-decreasing subsequences"],"prefix":"10.1007","volume":"56","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0304-7926","authenticated-orcid":false,"given":"Ludovic","family":"Patey","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,21]]},"reference":[{"issue":"1","key":"536_CR1","doi-asserted-by":"publisher","first-page":"143","DOI":"10.2178\/jsl\/1294170993","volume":"76","author":"V Brattka","year":"2011","unstructured":"Brattka, V., Gherardi, G.: Weihrauch degrees, omniscience principles and weak computability. J. Symb. Log. 76(1), 143\u2013176 (2011). doi:\n                        10.2178\/jsl\/1294170993","journal-title":"J. Symb. Log."},{"issue":"01","key":"536_CR2","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. Symb. Log. 66(01), 1\u201355 (2001)","journal-title":"J. Symb. Log."},{"issue":"3","key":"536_CR3","doi-asserted-by":"crossref","first-page":"1093","DOI":"10.1090\/S0002-9939-09-10115-6","volume":"138","author":"C Chong","year":"2010","unstructured":"Chong, C., Lempp, S., Yang, Y.: On the role of the collection principle for \n                        $$\\varSigma ^0_2$$\n                        \n                            \n                                            \n                                \n                                    \u03a3\n                                    2\n                                    0\n                                \n                            \n                        \n                    -formulas in second-order reverse mathematics. Proc. Am. Math. Soc. 138(3), 1093\u20131100 (2010)","journal-title":"Proc. Am. Math. Soc."},{"key":"536_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-68441-3","volume-title":"Algorithmic Randomness and Complexity","author":"RG Downey","year":"2010","unstructured":"Downey, R.G., Hirschfeldt, D.R.: Algorithmic Randomness and Complexity. Springer, New York (2010)"},{"issue":"2","key":"536_CR5","doi-asserted-by":"crossref","first-page":"557","DOI":"10.2178\/jsl\/1243948327","volume":"74","author":"DD Dzhafarov","year":"2009","unstructured":"Dzhafarov, D.D., Jockusch, C.G.: Ramsey\u2019s theorem and cone avoidance. J. Symb. Log. 74(2), 557\u2013578 (2009)","journal-title":"J. Symb. Log."},{"key":"536_CR6","unstructured":"Dzhafarov, D.D., Schweber, N.: Finding limit-nondecreasing sets for certain functions (2016). \n                        http:\/\/mathoverflow.net\/questions\/227766\/finding-limit-nondecreasing-sets-for-certain-functions\/"},{"key":"536_CR7","doi-asserted-by":"crossref","unstructured":"Hirschfeldt, D.R.: Some questions in computable mathematics. In: Computability and Complexity, pp. 22\u201355. Springer International Publishing (2017)","DOI":"10.1007\/978-3-319-50062-1_4"},{"issue":"1","key":"536_CR8","doi-asserted-by":"crossref","first-page":"171","DOI":"10.2178\/jsl\/1174668391","volume":"72","author":"DR Hirschfeldt","year":"2007","unstructured":"Hirschfeldt, D.R., Shore, R.A.: Combinatorial principles weaker than Ramsey\u2019s theorem for pairs. J. Symb. Log. 72(1), 171\u2013206 (2007)","journal-title":"J. Symb. Log."},{"issue":"11","key":"536_CR9","doi-asserted-by":"crossref","first-page":"5805","DOI":"10.1090\/S0002-9947-09-04847-8","volume":"361","author":"DR Hirschfeldt","year":"2009","unstructured":"Hirschfeldt, D.R., Shore, R.A., Slaman, T.A.: The atomic model theorem and type omitting. Trans. Am. Math. Soc. 361(11), 5805\u20135837 (2009)","journal-title":"Trans. Am. Math. Soc."},{"key":"536_CR10","first-page":"33","volume":"173","author":"CG Jockusch","year":"1972","unstructured":"Jockusch, C.G., Soare, R.I.: \n                        $$\\varPi ^0_1$$\n                        \n                            \n                                            \n                                \n                                    \u03a0\n                                    1\n                                    0\n                                \n                            \n                        \n                     classes and degrees of theories. Trans. Am. Math. Soc. 173, 33\u201356 (1972)","journal-title":"Trans. Am. Math. Soc."},{"issue":"3","key":"536_CR11","doi-asserted-by":"publisher","first-page":"1609","DOI":"10.1090\/S0002-9947-2014-06049-2","volume":"367","author":"L Liu","year":"2015","unstructured":"Liu, L.: Cone avoiding closed sets. Trans. Am. Math. Soc. 367(3), 1609\u20131630 (2015). doi:\n                        10.1090\/S0002-9947-2014-06049-2","journal-title":"Trans. Am. Math. Soc."},{"key":"536_CR12","doi-asserted-by":"publisher","unstructured":"Patey, L.: Iterative forcing and hyperimmunity in reverse mathematics. Computability (2015). doi:\n                        10.3233\/COM-160062","DOI":"10.3233\/COM-160062"},{"key":"536_CR13","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511581007","volume-title":"Subsystems of Second Order Arithmetic","author":"SG Simpson","year":"2009","unstructured":"Simpson, S.G.: Subsystems of Second Order Arithmetic. Cambridge University Press, Cambridge (2009)"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-017-0536-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-017-0536-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-017-0536-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,3]],"date-time":"2017-08-03T01:28:30Z","timestamp":1501723710000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-017-0536-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,21]]},"references-count":13,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["536"],"URL":"https:\/\/doi.org\/10.1007\/s00153-017-0536-9","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"type":"print","value":"0933-5846"},{"type":"electronic","value":"1432-0665"}],"subject":[],"published":{"date-parts":[[2017,4,21]]}}}