{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:53:37Z","timestamp":1759146817501},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642381638"},{"type":"electronic","value":"9783642381645"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-642-38164-5_2","type":"book-chapter","created":{"date-parts":[[2013,4,30]],"date-time":"2013-04-30T17:59:00Z","timestamp":1367344740000},"page":"7-20","source":"Crossref","is-referenced-by-count":3,"title":["Imperfect Information in Logic and Concurrent Games"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Clairambault","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julian","family":"Gutierrez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Glynn","family":"Winskel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Jagadeesan, R.: Game semantics for access control. Electronic Notes in Theoretical Computer Science\u00a0249 (2009)","DOI":"10.1016\/j.entcs.2009.07.088"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. J. ACM 49(5) (2002)","DOI":"10.1145\/585265.585270"},{"key":"2_CR3","unstructured":"Bradfield, J.C.: Independence: logics and concurrency. Acta Philosophica Fennica 78 (2006)"},{"key":"2_CR4","unstructured":"Bradfield, J.C., Fr\u00f6schle, S.B.: Independence-friendly modal logic and true concurrency. Nord. J. Comput. 9(1) (2002)"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Clairambault, P., Gutierrez, J., Winskel, G.: The winning ways of concurrent games. In: LICS. IEEE Comp. Soc. (2012)","DOI":"10.1109\/LICS.2012.34"},{"key":"2_CR6","unstructured":"Henkin, L.: Some remarks on infinitely long formulas. Infinitistic Methods (1961)"},{"key":"2_CR7","unstructured":"Hintikka, J., Sandu, G.: A revolution in logic? Nordic J. of Phil. Logic 1(2) (1996)"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Hodges, W.: Compositional semantics for a language of imperfect information. Logic Journal of the IGPL 5(4) (1997)","DOI":"10.1093\/jigpal\/5.4.539"},{"key":"2_CR9","unstructured":"Joyal, A.: Remarques sur la th\u00e9orie des jeux \u00e0 deux personnes. Gazette des sciences math\u00e9matiques du Qu\u00e9bec\u00a01(4) (1997)"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Mann, A.L., Sandu, G., Sevenster, M.: Independence-Friendly Logic: A Game-Theoretic Approach. London Mathematical Society Lecture Note Series, vol.\u00a0386. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511981418"},{"issue":"4","key":"2_CR11","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.2307\/2586667","volume":"63","author":"D.A. Martin","year":"1998","unstructured":"Martin, D.A.: The determinacy of blackwell games. The Journal of Symbolic Logic\u00a063(4), 1565\u20131581 (1998)","journal-title":"The Journal of Symbolic Logic"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-540-74407-8_27","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"P.-A. Melli\u00e8s","year":"2007","unstructured":"Melli\u00e8s, P.-A., Mimram, S.: Asynchronous games: innocence without alternation. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol.\u00a04703, pp. 395\u2013411. Springer, Heidelberg (2007)"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M. Nielsen","year":"1981","unstructured":"Nielsen, M., Plotkin, G., Winskel, G.: Petri nets, event structures and domains. Theoretical Computer Science\u00a013, 85\u2013108 (1981)","journal-title":"Theoretical Computer Science"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Rideau, S., Winskel, G.: Concurrent strategies. In: LICS. IEEE Comp. Soc. (2011)","DOI":"10.1109\/LICS.2011.13"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"V\u00e4\u00e4n\u00e4nen, J.A.: Dependence Logic - A New Approach to Independence Friendly Logic. London Mathematical Society Student Texts, vol.\u00a070. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511611193"}],"container-title":["Lecture Notes in Computer Science","Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38164-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T10:48:28Z","timestamp":1688208508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38164-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642381638","9783642381645"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38164-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}