{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:42:23Z","timestamp":1725745343512},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642403125"},{"type":"electronic","value":"9783642403132"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40313-2_50","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T14:36:43Z","timestamp":1376663803000},"page":"559-570","source":"Crossref","is-referenced-by-count":0,"title":["A Polychromatic Ramsey Theory for Ordinals"],"prefix":"10.1007","author":[{"given":"Martin","family":"Huschenbett","sequence":"first","affiliation":[]},{"given":"Jiamou","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"50_CR1","unstructured":"Blumensath, A., Gr\u00e4del, E.: Automatic structures. In: LICS 2000, pp. 51\u201362. IEEE Computer Society (2000)"},{"issue":"4","key":"50_CR2","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1002\/jgt.20317","volume":"58","author":"D. Conlon","year":"2008","unstructured":"Conlon, D.: A new upper bound for the bipartite Ramsey problem. Journal of Graph Theory\u00a058(4), 351\u2013356 (2008)","journal-title":"Journal of Graph Theory"},{"issue":"1","key":"50_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.crma.2004.03.035","volume":"339","author":"C. Delhomm\u00e9","year":"2004","unstructured":"Delhomm\u00e9, C.: Automaticit\u00e9 des ordinaux et des graphes homog\u00e8nes. Comptes Rendus Mathematique\u00a0339(1), 5\u201310 (2004)","journal-title":"Comptes Rendus Mathematique"},{"key":"50_CR4","unstructured":"Eilenberg, S.: Automata, Languages, and Machines. Pure and Applied Mathematics, vol.\u00a058. Academic Press (1974)"},{"key":"50_CR5","unstructured":"Erd\u0151s, P., Hajnal, A., M\u00e1t\u00e9, A., Rado, R.: Combinatorial set theory: Partition relations for cardinals. Studies in Logic, vol.\u00a0106. North-Holland (1984)"},{"issue":"5","key":"50_CR6","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1090\/S0002-9904-1956-10036-0","volume":"62","author":"P. Erd\u0151s","year":"1956","unstructured":"Erd\u0151s, P., Rado, R.: A partition calculus in set theory. Bull. Amer. Math. Soc.\u00a062(5), 427\u2013489 (1956)","journal-title":"Bull. Amer. Math. Soc."},{"issue":"3","key":"50_CR7","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/BF01215918","volume":"17","author":"A. Hajnal","year":"1997","unstructured":"Hajnal, A., Komj\u00e1th, P.: A strongly non-Ramsey order type. Combinatorica\u00a017(3), 363\u2013367 (1997)","journal-title":"Combinatorica"},{"issue":"2","key":"50_CR8","doi-asserted-by":"publisher","first-page":"268","DOI":"10.2307\/2272972","volume":"37","author":"C.G. Jockusch","year":"1972","unstructured":"Jockusch, C.G.: Ramsey\u2019s theorem and recursion theory. Journal of Symbolic Logic\u00a037(2), 268\u2013280 (1972)","journal-title":"Journal of Symbolic Logic"},{"key":"50_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/3-540-60178-3_93","volume-title":"Logic and Computational Complexity","author":"B. Khoussainov","year":"1995","unstructured":"Khoussainov, B., Nerode, A.: Automatic presentations of structures. In: Leivant, D. (ed.) LCC 1994. LNCS, vol.\u00a0960, pp. 367\u2013392. Springer, Heidelberg (1995)"},{"issue":"4","key":"50_CR10","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1145\/1094622.1094625","volume":"6","author":"B. Khoussainov","year":"2005","unstructured":"Khoussainov, B., Rubin, S., Stephan, F.: Automatic linear orders and trees. ACM Trans. Comp. Logic\u00a06(4), 675\u2013700 (2005)","journal-title":"ACM Trans. Comp. Logic"},{"key":"50_CR11","doi-asserted-by":"crossref","unstructured":"Kuske, D.: (Un)countable and (non)effective versions of Ramsey\u2019s theorem. Contemporary Mathematics, vol.\u00a0558, pp. 467\u2013487. Am. Math. Soc. (2011)","DOI":"10.1090\/conm\/558\/11057"},{"issue":"4","key":"50_CR12","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/BF01271269","volume":"16","author":"M. Pouzet","year":"1996","unstructured":"Pouzet, M., Sauer, N.: Edge partitions of the Rado graph. Combinatorica\u00a016(4), 505\u2013520 (1996)","journal-title":"Combinatorica"},{"key":"50_CR13","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1112\/plms\/s2-30.1.264","volume":"30","author":"F.P. Ramsey","year":"1930","unstructured":"Ramsey, F.P.: On a problem of formal logic. Proc. London Math. Soc.\u00a030, 264\u2013286 (1930)","journal-title":"Proc. London Math. Soc."},{"key":"50_CR14","unstructured":"Rosenstein, J.G.: Linear Orderings. Academic Press (1982)"},{"issue":"2","key":"50_CR15","doi-asserted-by":"publisher","first-page":"169","DOI":"10.2178\/bsl\/1208442827","volume":"14","author":"S. Rubin","year":"2008","unstructured":"Rubin, S.: Automata presenting structures: A survey of the finite string case. Bulletin of Symbolic Logic\u00a014(2), 169\u2013209 (2008)","journal-title":"Bulletin of Symbolic Logic"},{"key":"50_CR16","doi-asserted-by":"crossref","unstructured":"Soare, R.: Recursively Enumerable Sets and Degrees: A study of computable functions and computably generated sets. Perspectives in Mathematical Logic. Springer (1987)","DOI":"10.1007\/978-3-662-02460-7"},{"key":"50_CR17","doi-asserted-by":"crossref","unstructured":"Specker, E.: Ramsey\u2019s theorem does not hold in recursive set theory. In: Logic Colloqium 1969. Studies in Logic and the Foundations of Mathematics, vol.\u00a061, pp. 439\u2013442. North-Holland (1971)","DOI":"10.1016\/S0049-237X(08)71242-4"},{"issue":"2","key":"50_CR18","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1016\/0097-3165(94)90113-9","volume":"68","author":"S. Todorcevic","year":"1994","unstructured":"Todorcevic, S.: Some partitions of three-dimensional combinatorial cubes. Journal of Combinatorial Theory, Ser. A\u00a068(2), 410\u2013437 (1994)","journal-title":"Journal of Combinatorial Theory, Ser. A"},{"key":"50_CR19","unstructured":"Williams, N.: Combinatorial Set Theory. Elsevier (1977)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2013"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40313-2_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T02:11:28Z","timestamp":1558318288000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40313-2_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403125","9783642403132"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40313-2_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}