{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T12:21:28Z","timestamp":1765887688301},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,4,28]],"date-time":"2015-04-28T00:00:00Z","timestamp":1430179200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J of Log Lang and Inf"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s10849-015-9217-4","type":"journal-article","created":{"date-parts":[[2015,4,27]],"date-time":"2015-04-27T15:26:50Z","timestamp":1430148410000},"page":"149-191","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["A Double Team Semantics for Generalized Quantifiers"],"prefix":"10.1007","volume":"24","author":[{"given":"Antti","family":"Kuusisto","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,28]]},"reference":[{"key":"9217_CR1","doi-asserted-by":"crossref","unstructured":"Benaim, S., Benedikt, M., Charatonik, W., Kiero\u0144ski, E., Lenhardt, R., Mazowiecki, F., & Worrell., J. (2013). Complexity of two-variable logic on finite trees. In: Proceedings of the 40th international colloquium on automata, languages and programming (ICALP 2013), pp. 74\u201388.","DOI":"10.1007\/978-3-642-39212-2_10"},{"key":"9217_CR2","unstructured":"Bradfield, J. (2013). Team building in dependence. In: Proceedings of the 22nd EACSL annual conference on computer science logic (CSL 2013), pp. 116\u2013128."},{"key":"9217_CR3","doi-asserted-by":"crossref","unstructured":"Charatonik, W., & Witkowski, P. (2013). Two-variable logic with counting and trees. In: Proceedings of the 28th annual ACM\/IEEE symposium on logic in computer science (LICS 2013), pp. 73\u201382.","DOI":"10.1109\/LICS.2013.12"},{"issue":"3","key":"9217_CR4","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10849-012-9162-4","volume":"21","author":"F Engstr\u00f6m","year":"2012","unstructured":"Engstr\u00f6m, F. (2012). Generalized quantifiers in dependence logic. Journal of Logic, Language and Information, 21(3), 299\u2013324.","journal-title":"Journal of Logic, Language and Information"},{"issue":"1","key":"9217_CR5","doi-asserted-by":"crossref","first-page":"307","DOI":"10.2178\/jsl.7801210","volume":"78","author":"F Engstr\u00f6m","year":"2013","unstructured":"Engstr\u00f6m, F., & Kontinen, J. (2013). Characterizing quantifier extensions of dependence logic. Journal of Symbolic Logic, 78(1), 307\u2013316.","journal-title":"Journal of Symbolic Logic"},{"key":"9217_CR6","doi-asserted-by":"crossref","unstructured":"Engstr\u00f6m, F., Kontinen, J., & V\u00e4\u00e4n\u00e4nen, J. (2013). Dependence logic with generalized quantifiers: axiomatizations. In: Proceeings of the 20th workshop on logic, language, information and computation (WoLLiC 2013), pp. 138\u2013152.","DOI":"10.1007\/978-3-642-39992-3_14"},{"issue":"1","key":"9217_CR7","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/j.apal.2011.08.005","volume":"163","author":"P Galliani","year":"2012","unstructured":"Galliani, P. (2012). Inclusion and exclusion dependencies in team semantics: On some logics of imperfect information. Annals of Pure and Applied Logic, 163(1), 68\u201384.","journal-title":"Annals of Pure and Applied Logic"},{"key":"9217_CR8","unstructured":"Galliani, P., Hannula, M., & Kontinen, J. (2013). Hierarchies in independence logic. In: Proceedings of the 22nd EACSL annual conference on computer science logic (CSL 2013), pp. 263\u2013280."},{"key":"9217_CR9","unstructured":"Galliani, P., & Hella, L. Inclusion logic and fixed point logic. In: Proceedings of the 22nd EACSL annual conference on computer science logic (CSL 2013), pp. 281\u2013295."},{"key":"9217_CR10","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.tcs.2012.10.033","volume":"493","author":"E Gr\u00e4del","year":"2013","unstructured":"Gr\u00e4del, E. (2013). Model-checking games for logics of imperfect information. Theoretical Computer Science, 493, 2\u201314.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"9217_CR11","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/s11225-013-9479-2","volume":"101","author":"E Gr\u00e4del","year":"2013","unstructured":"Gr\u00e4del, E., & V\u00e4\u00e4n\u00e4nen, J. (2013). Dependence and independence. Studia Logica, 101(2), 399\u2013410.","journal-title":"Studia Logica"},{"key":"9217_CR12","doi-asserted-by":"crossref","unstructured":"Hintikka, J., & Sandu, G. (1989). Informational independence as a semantical phenomenon. In: Logic, methodology and philosophy of science, studies in logic and foundations of mathematics (vol. 126). North-Holland, Amsterdam.","DOI":"10.1016\/S0049-237X(08)70066-1"},{"key":"9217_CR13","doi-asserted-by":"crossref","unstructured":"Hodges, W. (1997). Compositional semantics for a langauge of imperfect information. Logic Journal of the IGPL, 5(4), electronic.","DOI":"10.1093\/jigpal\/5.4.539"},{"key":"9217_CR14","unstructured":"Kiero\u0144ski, E., & Michaliszyn, J. (2012). Two-variable universal logic with transitive closure. In: Proceedings of the 21st EACSL annual conference on computer science logic (CSL 2012), pp. 396\u2013410."},{"key":"9217_CR15","doi-asserted-by":"crossref","unstructured":"Kiero\u0144ski, E., Michaliszyn, J., Pratt-Hartmann, I., & Tendera, L. (2012). Two-variable first-order logic with equivalence closure. In: Proceedings of the 27th annual ACM\/IEEE symposium on logic in computer science (LICS 2012), pp. 431\u2013440.","DOI":"10.1109\/LICS.2012.53"},{"key":"9217_CR16","doi-asserted-by":"crossref","unstructured":"Kontinen, J., Kuusisto, A., Lohmann, P., & Virtema, J. (2011). Complexity of two-variable dependence logic and IF-logic. In: Proceedings of the 26th annual ACM\/IEEE symposium on logic in computer science (LICS 2011), pp. 289\u2013298.","DOI":"10.1109\/LICS.2011.14"},{"key":"9217_CR17","unstructured":"Kuusisto, A. (2010). Resource conscious quantification and ontologies with degrees of significance. Technical report. University of Tampere, Tampub electronic publications."},{"key":"9217_CR18","unstructured":"Kuusisto, A. (2012). Defining a double team semantics for generalized quantifiers. Technical report. University of Tampere, Tampub electronic publications."},{"key":"9217_CR19","first-page":"286","volume":"32","author":"P Lindstr\u00f6m","year":"1966","unstructured":"Lindstr\u00f6m, P. (1966). First order predicate logic with generalized quantifiers. Theoria, 32, 286\u2013195.","journal-title":"Theoria"},{"key":"9217_CR20","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511981418","volume-title":"Independence-friendly logic: A game theoretic approach","author":"A Mann","year":"2011","unstructured":"Mann, A., Sandu, G., & Sevenster, M. (2011). Independence-friendly logic: A game theoretic approach. Cambridge: Cambridge University Press."},{"key":"9217_CR21","unstructured":"Manuel, A., & Zeume, T. (2013). Two-variable logic on 2-dimensional structures. In: Proceedings of the 22nd EACSL annual conference on computer science logic (CSL 2013), pp. 484\u2013499."},{"issue":"3","key":"9217_CR22","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s10849-005-5791-1","volume":"14","author":"I Pratt-Hartmann","year":"2005","unstructured":"Pratt-Hartmann, I. (2005). Complexity of the two-variable fragment with counting quantifiers. Journal of Logic, Language and Information, 14(3), 369\u2013395.","journal-title":"Journal of Logic, Language and Information"},{"key":"9217_CR23","unstructured":"Steels, L. & Kaplan, F. (2001). AIBO\u2019s first words. The social learning of language and meaning. In: Evolution of Communication (Vol. 4, no. 1), Amsterdam: John Benjamins Publishing Company."},{"key":"9217_CR24","unstructured":"Szwast W., & Tendera, L. (2013). $$FO^2$$ F O 2 with one transitive relation is decidable. In: Proceedings of the 30th symposium on theoretical aspects of computer science (STACS 2013), pp. 317\u2013328."},{"key":"9217_CR25","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511611193","volume-title":"Dependence logic","author":"J V\u00e4\u00e4n\u00e4nen","year":"2007","unstructured":"V\u00e4\u00e4n\u00e4nen, J. (2007). Dependence logic. Cambridge: Cambridge University Press."},{"key":"9217_CR26","volume-title":"Philosophical investigations","author":"L Wittgenstein","year":"1953","unstructured":"Wittgenstein, L. (1953). Philosophical investigations. Oxford: Blackwell."}],"container-title":["Journal of Logic, Language and Information"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10849-015-9217-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10849-015-9217-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10849-015-9217-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,24]],"date-time":"2019-08-24T04:53:48Z","timestamp":1566622428000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10849-015-9217-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,28]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["9217"],"URL":"https:\/\/doi.org\/10.1007\/s10849-015-9217-4","relation":{},"ISSN":["0925-8531","1572-9583"],"issn-type":[{"value":"0925-8531","type":"print"},{"value":"1572-9583","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,28]]}}}