{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:21:35Z","timestamp":1742977295996,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662477083"},{"type":"electronic","value":"9783662477090"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47709-0_6","type":"book-chapter","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T07:07:37Z","timestamp":1435043257000},"page":"69-80","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Dichotomy Result for Ramsey Quantifiers"],"prefix":"10.1007","author":[{"given":"Ronald","family":"de Haan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakub","family":"Szymanik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"key":"6_CR1","volume-title":"Quantifiers in Language and Logic","author":"S Peters","year":"2006","unstructured":"Peters, S., Westerst\u00e5hl, D.: Quantifiers in Language and Logic. Clarendon Press, Oxford (2006)"},{"issue":"1\u20133","key":"6_CR2","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.apal.2003.11.016","volume":"127","author":"M Mostowski","year":"2004","unstructured":"Mostowski, M., Wojtyniak, D.: Computational complexity of the semantics of some natural language constructions. Ann. Pure Appl Logic 127(1\u20133), 219\u2013227 (2004)","journal-title":"Ann. Pure Appl Logic"},{"key":"6_CR3","unstructured":"Sevenster, M.: Branches of imperfect information: logic, games, and computation. Ph.D. thesis, University of Amsterdam (2006)"},{"issue":"4","key":"6_CR4","doi-asserted-by":"publisher","first-page":"1224","DOI":"10.1017\/jsl.2013.30","volume":"79","author":"M Sevenster","year":"2014","unstructured":"Sevenster, M.: Dichotomy result for independence-friendly prefixes of generalized quantifiers. J. Symb. Logic 79(4), 1224\u20131246 (2014)","journal-title":"J. Symb. Logic"},{"key":"6_CR5","unstructured":"Szymanik, J.: Quantifiers in TIME and SPACE. computational complexity of generalized quantifiers in natural language. Ph.D. thesis, University of Amsterdam, Amsterdam (2009)"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s10988-010-9076-z","volume":"33","author":"J Szymanik","year":"2010","unstructured":"Szymanik, J.: Computational complexity of polyadic lifts of generalized quantifiers in natural language. Linguist. Philos. 33, 215\u2013250 (2010)","journal-title":"Linguist. Philos."},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1023\/A:1005330227480","volume":"21","author":"M Dalrymple","year":"1998","unstructured":"Dalrymple, M., Kanazawa, M., Kim, Y., Mchombo, S., Peters, S.: Reciprocal expressions and the concept of reciprocity. Linguist. Philos. 21, 159\u2013210 (1998)","journal-title":"Linguist. Philos."},{"issue":"4","key":"6_CR8","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s10849-013-9181-9","volume":"22","author":"F Schlotterbeck","year":"2013","unstructured":"Schlotterbeck, F., Bott, O.: Easy solutions for a hard problem? The computational complexity of reciprocals with quantificational antecedents. J. Logic Lang. Inform. 22(4), 363\u2013390 (2013)","journal-title":"J. Logic Lang. Inform."},{"key":"6_CR9","unstructured":"Thorne, C., Szymanik, J.: Semantic complexity of quantifiers and their distribution in corpora. In: Proceedings of the International Conference on Computational Semantics (2015)"},{"issue":"3","key":"6_CR10","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1023\/A:1008209019899","volume":"6","author":"J V\u00e4\u00e4n\u00e4nen","year":"1997","unstructured":"V\u00e4\u00e4n\u00e4nen, J.: Unary quantifiers on finite models. J. Logic Lang. Inform. 6(3), 275\u2013304 (1997)","journal-title":"J. Logic Lang. Inform."},{"issue":"3","key":"6_CR11","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1023\/A:1008215718090","volume":"6","author":"L Hella","year":"1997","unstructured":"Hella, L., V\u00e4\u00e4n\u00e4nen, J., Westerst\u00e5hl, D.: Definability of polyadic lifts of generalized quantifiers. J. Logic Lang. Inform. 6(3), 305\u2013335 (1997)","journal-title":"J. Logic Lang. Inform."},{"key":"6_CR12","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1111\/j.1755-2567.1966.tb00600.x","volume":"32","author":"P Lindstr\u00f6m","year":"1966","unstructured":"Lindstr\u00f6m, P.: First order predicate logic with generalized quantifiers. Theoria 32, 186\u2013195 (1966)","journal-title":"Theoria"},{"key":"6_CR13","series-title":"Texts in Computer Science","volume-title":"Descriptive Complexity","author":"N Immerman","year":"1998","unstructured":"Immerman, N.: Descriptive Complexity. Texts in Computer Science. Springer, New York (1998)"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0168-0072(86)90040-0","volume":"32","author":"A Blass","year":"1986","unstructured":"Blass, A., Gurevich, Y.: Henkin quantifiers and complete problems. Ann. Pure Appl. Logic 32, 1\u201316 (1986)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1","key":"6_CR15","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1145\/321864.321877","volume":"22","author":"RE Ladner","year":"1975","unstructured":"Ladner, R.E.: On the structure of polynomial time reducibility. J. ACM 22(1), 155\u2013171 (1975)","journal-title":"J. ACM"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, STOC 1978, New York, NY, USA, pp. 216\u2013226. ACM (1978)","DOI":"10.1145\/800133.804350"},{"key":"6_CR17","series-title":"Texts in Theoretical Computer Science. An EATCS Series","volume-title":"Finite Model Theory and Its Applications","author":"E Gr\u00e4del","year":"2007","unstructured":"Gr\u00e4del, E., Kolaitis, P.G., Libkin, L., Marx, M., Spencer, J., Vardi, M.Y., Venema, Y., Weinstein, S.: Finite Model Theory and Its Applications. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2007)"},{"issue":"2","key":"6_CR18","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of k-SAT. J. Comput. Syst. Sci. 62(2), 367\u2013375 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR19","first-page":"41","volume":"105","author":"D Lokshtanov","year":"2011","unstructured":"Lokshtanov, D., Marx, D., Saurabh, S.: Lower bounds based on the exponential time hypothesis. Bull. EATCS 105, 41\u201372 (2011)","journal-title":"Bull. EATCS"},{"key":"6_CR20","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)"},{"issue":"2","key":"6_CR21","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/j.ic.2005.05.001","volume":"201","author":"J Chen","year":"2005","unstructured":"Chen, J., Chor, B., Fellows, M., Huang, X., Juedes, D., Kanj, I.A., Xia, G.: Tight lower bounds for certain parameterized NP-hard problems. Inf. Comput. 201(2), 216\u2013231 (2005)","journal-title":"Inf. Comput."},{"issue":"2","key":"6_CR22","first-page":"338","volume":"30","author":"F Ramsey","year":"1929","unstructured":"Ramsey, F.: On a problem of formal logic. Proc. London Math. Soc. 30(2), 338\u2013384 (1929)","journal-title":"Proc. London Math. Soc."},{"issue":"1","key":"6_CR23","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/S0304-3975(01)00343-7","volume":"289","author":"L Cai","year":"2002","unstructured":"Cai, L., Juedes, D., Kanj, I.: The inapproximability of non-NP-hard optimization problems. Theoret. Comput. Sci. 289(1), 553\u2013571 (2002)","journal-title":"Theoret. Comput. Sci."},{"issue":"8","key":"6_CR24","doi-asserted-by":"publisher","first-page":"1346","DOI":"10.1016\/j.jcss.2006.04.007","volume":"72","author":"J Chen","year":"2006","unstructured":"Chen, J., Huang, X., Kanj, I.A., Xia, G.: Strong computational lower bounds via parameterized complexity. J. Comput. Syst. Sci. 72(8), 1346\u20131367 (2006)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47709-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,9]],"date-time":"2024-06-09T17:22:56Z","timestamp":1717953776000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47709-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662477083","9783662477090"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47709-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}