{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:46:40Z","timestamp":1743130000301,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540699361"},{"type":"electronic","value":"9783540699378"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-69937-8_15","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"164-178","source":"Crossref","is-referenced-by-count":0,"title":["On the Formal Semantics of IF-Like Logics"],"prefix":"10.1007","author":[{"given":"Santiago","family":"Figueira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Gor\u00edn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafael","family":"Grimson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Studies in logic and the foundations of mathematics","volume-title":"The Lambda Calculus: its syntax and semantics","author":"H. Barendregt","year":"1985","unstructured":"Barendregt, H.: The Lambda Calculus: its syntax and semantics, 2nd edn. Studies in logic and the foundations of mathematics, vol.\u00a0103. North Holland, Amsterdam (1985)","edition":"2"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF00258419","volume":"8","author":"J. Barwise","year":"1979","unstructured":"Barwise, J.: On branching quantifiers in English. Journal of Philosophical Logic\u00a08, 47\u201380 (1979)","journal-title":"Journal of Philosophical Logic"},{"key":"15_CR3","unstructured":"Caicedo, X., Dechesne, F., Jansen, T.M.V.: Equivalence and quantifier rules for logic with imperfect information. Prepublication Series PP-2007-20. ILLC (2007)"},{"key":"15_CR4","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1090\/conm\/235\/03463","volume":"235","author":"X. Caicedo","year":"1999","unstructured":"Caicedo, X., Krynicki, M.: Quantifiers for reasoning with imperfect information and $\\Sigma^1_1$-logic. Contemporary Mathematics\u00a0235, 17\u201331 (1999)","journal-title":"Contemporary Mathematics"},{"key":"15_CR5","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/1385-7258(72)90034-0","volume":"34","author":"N.G. de Bruijn","year":"1972","unstructured":"de Bruijn, N.G.: Lambda calculus notation with nameless dummies. A tool for automatic formula manipulation with application to the Church-Rosser theorem. Indagationes Mathematicae\u00a034, 381\u2013392 (1972)","journal-title":"Indagationes Mathematicae"},{"key":"15_CR6","unstructured":"Dechesne, F.: Game, Sets, Maths: formal investigations into logic with imperfect information. PhD thesis, Department of Philosophy, University of Tilburg, The Netherlands (2005)"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/malq.19700160802","volume":"16","author":"H. Enderton","year":"1970","unstructured":"Enderton, H.: Finite partially ordered quantifiers. Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik\u00a016, 393\u2013397 (1970)","journal-title":"Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik"},{"key":"15_CR8","first-page":"167","volume-title":"Infinitistic Methods: Proceedings of the Symposium on Foundations of Mathematics","author":"L. Henkin","year":"1961","unstructured":"Henkin, L.: Some remarks on infinitely long formulas. In: Infinitistic Methods: Proceedings of the Symposium on Foundations of Mathematics, pp. 167\u2013183. Pergamon Press, Oxford (1961)"},{"key":"15_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511624919","volume-title":"The Principles of Mathematics Revisited","author":"J. Hintikka","year":"1996","unstructured":"Hintikka, J.: The Principles of Mathematics Revisited. Cambridge University Press, Cambridge (1996)"},{"key":"15_CR10","volume-title":"Handbook of logic and language, ch. 6","author":"J. Hintikka","year":"1997","unstructured":"Hintikka, J., Sandu, G.: Game-theoretical semantics. In: van Benthem, J., ter Meulen, A. (eds.) Handbook of logic and language, ch. 6. MIT Press, Cambridge (1997)"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Hodges, W.: Compositional semantics for a language of imperfect information. Logic Journal of the IGPL\u00a05(4) (1997)","DOI":"10.1093\/jigpal\/5.4.539"},{"key":"15_CR12","unstructured":"Hodges, W.: Logics of imperfect information: why sets of assignments? In: Proceedings of the 7th Augustus de Morgan Workshop Interactive Logic: Games and Social Software (2005)"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.\u00a01261, pp. 51\u201365. Springer, Heidelberg (1997)"},{"issue":"3","key":"15_CR14","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1023\/A:1015542413718","volume":"11","author":"T.M.V. Janssen","year":"2002","unstructured":"Janssen, T.M.V.: Independent choices and the interpretation of IF logic. Journal of Logic, Language and Information\u00a011(3), 367\u2013387 (2002)","journal-title":"Journal of Logic, Language and Information"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-1-4020-5012-7_15","volume-title":"The age of alternative logics, ch. 15","author":"T.M.V. Janssen","year":"2006","unstructured":"Janssen, T.M.V., Dechesne, F.: Signalling in IF games: a tricky business. In: The age of alternative logics, ch. 15, pp. 221\u2013241. Springer, Heidelberg (2006)"},{"issue":"4","key":"15_CR16","doi-asserted-by":"publisher","first-page":"535","DOI":"10.2307\/2271440","volume":"35","author":"W. Walkoe Jr.","year":"1970","unstructured":"Walkoe Jr., W.: Finite partially-ordered quantification. Journal of Symbolic Logic\u00a035(4), 535\u2013555 (1970)","journal-title":"Journal of Symbolic Logic"}],"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-540-69937-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T06:50:51Z","timestamp":1715237451000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-69937-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540699361","9783540699378"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69937-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}