{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:39:00Z","timestamp":1725514740071},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540694052"},{"type":"electronic","value":"9783540694076"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69407-6_23","type":"book-chapter","created":{"date-parts":[[2008,6,10]],"date-time":"2008-06-10T13:39:35Z","timestamp":1213105175000},"page":"196-205","source":"Crossref","is-referenced-by-count":0,"title":["Subrecursive Complexity of Identifying the Ramsey Structure of Posets"],"prefix":"10.1007","author":[{"given":"Willem L.","family":"Fouch\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"572","DOI":"10.2307\/2273534","volume":"43","author":"F.G. Abramson","year":"1978","unstructured":"Abramson, F.G., Harrington, L.O.: Models without indiscernables. J. Symb. Logic\u00a043, 572\u2013600 (1978)","journal-title":"J. Symb. Logic"},{"key":"23_CR2","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF00338745","volume":"13","author":"W.L. Fouch\u00e9","year":"1996","unstructured":"Fouch\u00e9, W.L.: Chain partitions of ordered sets. Order\u00a013, 255\u2013266 (1996)","journal-title":"Order"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S0012-365X(96)00236-1","volume":"167\/168","author":"W.L. Fouch\u00e9","year":"1997","unstructured":"Fouch\u00e9, W.L.: Symmetry and the Ramsey degree of posets. Discrete Math.\u00a0167\/168, 309\u2013315 (1997)","journal-title":"Discrete Math."},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1006\/jcta.1998.2910","volume":"85","author":"W.L. Fouch\u00e9","year":"1999","unstructured":"Fouch\u00e9, W.L.: Symmetry and the Ramsey degree of finite relational structures. J. Comb. Theory Ser A\u00a085, 135\u2013147 (1999)","journal-title":"J. Comb. Theory Ser A"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.disc.2004.08.035","volume":"293","author":"W.L. Fouch\u00e9","year":"2005","unstructured":"Fouch\u00e9, W.L., Pretorius, L.M., Swanepoel, C.J.: The Ramsey degrees of bipartite graphs: A primitive recursive proof. Discrete Math.\u00a0293, 111\u2013119 (2005)","journal-title":"Discrete Math."},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"257","DOI":"10.2307\/1996010","volume":"159","author":"R.L. Graham","year":"1971","unstructured":"Graham, R.L., Rothschild, B.L.: Ramsey\u2019s theorem for n-parameter sets. Trans. Amer. Math. Soc.\u00a0159, 257\u2013292 (1971)","journal-title":"Trans. Amer. Math. Soc."},{"key":"23_CR7","volume-title":"Ramsey Theory","author":"R.L. Graham","year":"1990","unstructured":"Graham, R.L., Rothschild, B.L., Spencer, J.L.: Ramsey Theory. Wiley, New York (1990)"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"222","DOI":"10.2307\/1993764","volume":"106","author":"A.W. Hales","year":"1963","unstructured":"Hales, A.W., Jewett, R.I.: Regularity and positional games. Trans. Amer. Math. Soc.\u00a0106, 222\u2013229 (1963)","journal-title":"Trans. Amer. Math. Soc."},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/s00039-005-0503-1","volume":"15","author":"A.S. Kechris","year":"2005","unstructured":"Kechris, A.S., Pestov, V., Todorcevic, S.: Fra\u00efss\u00e9 limits, Ramsey theory, and topological dynamics of automorphism groups. GAFA\u00a015, 106\u2013189 (2005)","journal-title":"GAFA"},{"key":"23_CR10","first-page":"1331","volume-title":"Handbook of Combinatorics","author":"J. Ne\u0161et\u0159il","year":"1995","unstructured":"Ne\u0161et\u0159il, J.: Ramsey theory. In: Graham, R.L., Gr\u00f6tschel, M., Lov\u00e1sz, L. (eds.) Handbook of Combinatorics, vol.\u00a02, pp. 1331\u20131403. North Holland, Amsterdam (1995)"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0097-3165(77)90004-8","volume":"83","author":"J. Ne\u0161et\u0159il","year":"1977","unstructured":"Ne\u0161et\u0159il, J., R\u00f6dl, V.: Partitions of relational and set systems. J. Comb. Theory Ser A\u00a083, 289\u2013312 (1977)","journal-title":"J. Comb. Theory Ser A"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0097-3165(83)90055-9","volume":"34","author":"J. Ne\u0161et\u0159il","year":"1983","unstructured":"Ne\u0161et\u0159il, J., R\u00f6dl, V.: Ramsey classes of set systems. J. Comb. Theory Ser A\u00a034, 183\u2013201 (1983)","journal-title":"J. Comb. Theory Ser A"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/BF01191498","volume":"19","author":"J. Ne\u0161et\u0159il","year":"1984","unstructured":"Ne\u0161et\u0159il, J., R\u00f6dl, V.: Combinatorial partitions of finite posets and lattices\u2013 Ramsey lattices. Algebra Universalis\u00a019, 106\u2013119 (1984)","journal-title":"Algebra Universalis"},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0012-365X(89)90097-6","volume":"75","author":"J. Ne\u0161et\u0159il","year":"1989","unstructured":"Ne\u0161et\u0159il, J., R\u00f6dl, V.: The partite construction and Ramsey set systems. Discrete Math.\u00a075, 327\u2013334 (1989)","journal-title":"Discrete Math."},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Paoli, M., Trotter, W.T., Walker, J.W.: Graphs and orders in Ramsey theory and in dimension theory. In: Rival, I. (ed.) Graphs and Order, Reidel (1984)","DOI":"10.1007\/978-94-009-5315-4_9"},{"key":"23_CR16","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/978-3-642-72905-8_9","volume-title":"Mathematics of Ramsey Theory","author":"H.J. Pr\u00f6mel","year":"1990","unstructured":"Pr\u00f6mel, H.J., Voigt, B.: Graham-Rothschild parameter sets. In: Ne\u0161et\u0159il, J., R\u00f6dl, V. (eds.) Mathematics of Ramsey Theory, pp. 113\u2013149. Springer, Berlin (1990)"},{"key":"23_CR17","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":"23_CR18","doi-asserted-by":"publisher","first-page":"683","DOI":"10.2307\/1990952","volume":"1","author":"S. Shelah","year":"1988","unstructured":"Shelah, S.: Primitive recursive bounds for van der Waerden numbers. J. Amer. Math. Soc.\u00a01, 683\u2013697 (1988)","journal-title":"J. Amer. Math. Soc."},{"key":"23_CR19","volume-title":"The Theory of Computability","author":"R. Sommerhalder","year":"1988","unstructured":"Sommerhalder, R., van Westhenen, S.C.: The Theory of Computability. Addison Wesley, Reading (1988)"}],"container-title":["Lecture Notes in Computer Science","Logic and Theory of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69407-6_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T19:31:51Z","timestamp":1684438311000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69407-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540694052","9783540694076"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69407-6_23","relation":{},"subject":[]}}