{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T17:23:51Z","timestamp":1725902631428},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662553855"},{"type":"electronic","value":"9783662553862"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-662-55386-2_2","type":"book-chapter","created":{"date-parts":[[2017,6,28]],"date-time":"2017-06-28T07:24:53Z","timestamp":1498634693000},"page":"14-30","source":"Crossref","is-referenced-by-count":2,"title":["Independence-Friendly Logic Without Henkin Quantification"],"prefix":"10.1007","author":[{"given":"Fausto","family":"Barbero","sequence":"first","affiliation":[]},{"given":"Lauri","family":"Hella","sequence":"additional","affiliation":[]},{"given":"Raine","family":"R\u00f6nnholm","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,29]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1017\/S175502031200038X","volume":"6","author":"F Barbero","year":"2013","unstructured":"Barbero, F.: On existential declarations of independence in IF logic. Rev. Symb. Log. 6, 254\u2013280 (2013)","journal-title":"Rev. Symb. Log."},{"key":"2_CR2","unstructured":"Barbero, F.: Complexity of syntactical tree fragments of Independence-Friendly logic. pre-print arXiv:1610.03406"},{"key":"2_CR3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1093\/jigpal\/jzn030","volume":"17","author":"X Caicedo","year":"2009","unstructured":"Caicedo, X., Dechesne, F., Janssen, T.M.V.: Equivalence and quantifier rules for logic with imperfect information. Log. J. IGPL 17, 91\u2013129 (2009)","journal-title":"Log. J. IGPL"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Caicedo, X., Krynicki, M.: Quantifiers for reasoning with imperfect information and $$\\Sigma _1^1$$ -logic. In: Carnielli, W.A., D\u2019Ottaviano, I.M.L. (eds.) Contemporary Mathematics, vol. 235, pp. 17\u201331. American Mathematical Society (1999)","DOI":"10.1090\/conm\/235\/03463"},{"key":"2_CR5","doi-asserted-by":"crossref","first-page":"673","DOI":"10.2307\/2695036","volume":"66","author":"P Cameron","year":"2001","unstructured":"Cameron, P., Hodges, W.: Some combinatorics of imperfect information. J. Symb. Log. 66, 673\u2013684 (2001)","journal-title":"J. Symb. Log."},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Dahlhaus, E.: Reduction to NP-complete problems by interpretations. In: Proceedings of the Symposium \u201cRekursive Kombinatorik\u201d on Logic and Machines: Decision Problems and Complexity, pp. 357\u2013365 (1983)","DOI":"10.1007\/3-540-13331-3_51"},{"issue":"8","key":"2_CR7","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/malq.19700160802","volume":"16","author":"HB Enderton","year":"1970","unstructured":"Enderton, H.B.: Finite partially ordered quantifiers. Math. Log. Q. 16(8), 393\u2013397 (1970)","journal-title":"Math. Log. Q."},{"key":"2_CR8","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/0022-0000(90)90009-A","volume":"40","author":"E Grandjean","year":"1990","unstructured":"Grandjean, E.: First-order spectra with one variable. J. Comput. Syst. Sci. 40, 136\u2013153 (1990)","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR9","unstructured":"Henkin, L.: Some remarks on infinitely long formulas. In: Infinitistic Methods. Pergamon Press, Oxford, New York (1961)"},{"key":"2_CR10","first-page":"571","volume-title":"Logic, Methodology and Philosophy of Science VIII","author":"J Hintikka","year":"1989","unstructured":"Hintikka, J., Sandu, G.: Informational independence as a semantical phenomenon. In: Fenstad, J.E., et al. (eds.) Logic, Methodology and Philosophy of Science VIII, pp. 571\u2013589. Elsevier Science Publishers B.V, Amsterdam (1989)"},{"key":"2_CR11","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1093\/jigpal\/5.4.539","volume":"5","author":"W Hodges","year":"1997","unstructured":"Hodges, W.: Compositional semantics for a language of imperfect information. Log. J. IGPL 5, 539\u2013563 (1997)","journal-title":"Log. J. IGPL"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-63246-8_4","volume-title":"Structures in Logic and Computer Science","author":"W Hodges","year":"1997","unstructured":"Hodges, W.: Some strange quantifiers. In: Mycielski, J., Rozenberg, G., Salomaa, A. (eds.) Structures in Logic and Computer Science. LNCS, vol. 1261, pp. 51\u201365. Springer, Heidelberg (1997). doi: 10.1007\/3-540-63246-8_4"},{"key":"2_CR13","unstructured":"Hyttinen, T., Tulenheimo, T.: Decidability of IF modal logic of perfect recall. In: Advances in Modal Logic, vol. 5 (2005)"},{"key":"2_CR14","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1002\/malq.19930390134","volume":"39","author":"M Krynicki","year":"1993","unstructured":"Krynicki, M.: Hierarchies of partially ordered connectives and quantifiers. Math. Log. Q. 39, 287\u2013294 (1993)","journal-title":"Math. Log. Q."},{"key":"2_CR15","series-title":"London Mathematical Society Lecture Note Series","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511981418","volume-title":"Independence-Friendly Logic - a Game-Theoretic Approach","author":"AL Mann","year":"2011","unstructured":"Mann, A.L., Sandu, G., Sevenster, M.: Independence-Friendly Logic - a Game-Theoretic Approach. London Mathematical Society Lecture Note Series, vol. 386. Cambridge University Press, Cambridge (2011)"},{"key":"2_CR16","unstructured":"Sevenster, M.: Branches of imperfect information: logic, games, and computation. Ph.D. thesis, ILLC, Universiteit van Amsterdam (2006)"},{"issue":"04","key":"2_CR17","doi-asserted-by":"crossref","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. Symbol. Log. 79(04), 1224\u20131246 (2014)","journal-title":"J. Symbol. Log."},{"key":"2_CR18","series-title":"London Mathematical Society Student Texts","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511611193","volume-title":"A New Approach to Independence Friendly Logic","author":"J V\u00e4\u00e4n\u00e4nen","year":"2007","unstructured":"V\u00e4\u00e4n\u00e4nen, J., Logic, D.: A New Approach to Independence Friendly Logic. London Mathematical Society Student Texts, vol. 70. Cambridge University Press, Cambridge (2007)"},{"key":"2_CR19","unstructured":"Virtema, J.: Approaches to finite variable dependence. Ph.D. thesis, University of Tampere (2014)"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-55386-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,27]],"date-time":"2019-09-27T05:14:29Z","timestamp":1569561269000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-55386-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662553855","9783662553862"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-55386-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}