{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T16:02:28Z","timestamp":1765123348936,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030860585"},{"type":"electronic","value":"9783030860592"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86059-2_25","type":"book-chapter","created":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T17:48:17Z","timestamp":1630432097000},"page":"428-445","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Game Semantics for Constructive Modal Logic"],"prefix":"10.1007","author":[{"given":"Matteo","family":"Acclavio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Davide","family":"Catta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lutz","family":"Stra\u00dfburger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,30]]},"reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-57887-0_87","volume-title":"Theoretical Aspects of Computer Software","author":"S Abramsky","year":"1994","unstructured":"Abramsky, S., Malacaria, P., Jagadeesan, R.: Full abstraction for PCF (extended abstract). In: Hagiya, M., Mitchell, J.C. (eds.) TACS 1994. LNCS, vol. 789, pp. 1\u201315. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-57887-0_87"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Acclavio, M., Catta, D., Stra\u00dfburger, L.: Towards a denotational semantics for proofs in constructive modal logic, April 2021. https:\/\/hal.archives-ouvertes.fr\/hal-03201439 (preprint)","DOI":"10.1007\/978-3-030-86059-2_25"},{"key":"25_CR3","unstructured":"Bellin, G., De Paiva, V., Ritter, E.: Extended Curry-Howard correspondence for a basic constructive modal logic. In: Proceedings of Methods for Modalities, May 2001"},{"issue":"3","key":"25_CR4","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1023\/A:1005291931660","volume":"65","author":"GM Bierman","year":"2000","unstructured":"Bierman, G.M., de Paiva, V.C.: On an intuitionistic modal logic. Stud. Logica 65(3), 383\u2013416 (2000)","journal-title":"Stud. Logica"},{"issue":"6","key":"25_CR5","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s00153-009-0137-3","volume":"48","author":"K Br\u00fcnnler","year":"2009","unstructured":"Br\u00fcnnler, K.: Deep sequent systems for modal logic. Arch. Math. Logic 48(6), 551\u2013577 (2009)","journal-title":"Arch. Math. Logic"},{"issue":"3","key":"25_CR6","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/382780.382785","volume":"48","author":"R Davies","year":"2001","unstructured":"Davies, R., Pfenning, F.: A modal analysis of staged computation. J. ACM (JACM) 48(3), 555\u2013604 (2001)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"25_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1997.2627","volume":"137","author":"M Fairtlough","year":"1997","unstructured":"Fairtlough, M., Mendler, M.: Propositional lax logic. Inf. Comput. 137(1), 1\u201333 (1997)","journal-title":"Inf. Comput."},{"issue":"2","key":"25_CR8","first-page":"113","volume":"7","author":"FB Fitch","year":"1948","unstructured":"Fitch, F.B.: Intuitionistic modal logic with quantifiers. Port. Math. 7(2), 113\u2013118 (1948)","journal-title":"Port. Math."},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-540-73595-3_9","volume-title":"Automated Deduction \u2013 CADE-21","author":"S Heilala","year":"2007","unstructured":"Heilala, S., Pientka, B.: Bidirectional decision procedures for the intuitionistic propositional modal logic IS4. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 116\u2013131. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73595-3_9"},{"key":"25_CR10","doi-asserted-by":"publisher","unstructured":"Horne, R., Ahn, K.Y., Lin, S.W., Tiu, A.: Quasi-open bisimilarity with mismatch is intuitionistic. In: Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2018, New York, NY, USA, pp. 26\u201335. Association for Computing Machinery (2018). https:\/\/doi.org\/10.1145\/3209108.3209125","DOI":"10.1145\/3209108.3209125"},{"key":"25_CR11","doi-asserted-by":"publisher","unstructured":"Hyland, J., Ong, C.H.: On full abstraction for PCF: I, II, and III. Inf. Comput. 163(2), 285\u2013408 (2000). https:\/\/doi.org\/10.1006\/inco.2000.2917. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0890540100929171","DOI":"10.1006\/inco.2000.2917"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-540-76637-7_27","volume-title":"Programming Languages and Systems","author":"Y Kakutani","year":"2007","unstructured":"Kakutani, Y.: Call-by-name and call-by-value in normal modal logic. In: Shao, Z. (ed.) APLAS 2007. LNCS, vol. 4807, pp. 399\u2013414. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76637-7_27"},{"key":"25_CR13","unstructured":"Kojima, K.: Semantical study of intuitionistic modal logics. Ph.D. thesis, Kyoto University (2012)"},{"key":"25_CR14","unstructured":"Kuznets, R., Marin, S., Stra\u00dfburger, L.: Justification logic for constructive modal logic *. In: 7th Workshop on Intuitionistic Modal Logic and Applications, IMLA 2017, July 2017. https:\/\/hal.inria.fr\/hal-01614707"},{"key":"25_CR15","unstructured":"Lamarche, F.: Proof nets for intuitionistic linear logic: essential nets (2008). https:\/\/hal.inria.fr\/inria-00347336"},{"key":"25_CR16","unstructured":"Marin, S., Stra\u00dfburger, L.: Label-free modular systems for classical and intuitionistic modal logics. In: Advances in Modal Logic 10 (2014)"},{"key":"25_CR17","doi-asserted-by":"publisher","unstructured":"McCusker, G.: Games and full abstraction for FPC. Inf. Comput. 160(1), 1\u201361 (2000). https:\/\/doi.org\/10.1006\/inco.1999.2845. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0890540199928456","DOI":"10.1006\/inco.1999.2845"},{"issue":"12","key":"25_CR18","doi-asserted-by":"publisher","first-page":"1465","DOI":"10.1016\/j.ic.2011.10.003","volume":"209","author":"M Mendler","year":"2011","unstructured":"Mendler, M., Scheele, S.: Cut-free Gentzen calculus for multimodal CK. Inf. Comput. 209(12), 1465\u20131490 (2011)","journal-title":"Inf. Comput."},{"key":"25_CR19","doi-asserted-by":"publisher","unstructured":"Meyer, J.J., Veltmanw, F.: Intelligent agents and common sense reasoning. In: Blackburn, P., Van Benthem, J., Wolter, F. (eds.) Handbook of Modal Logic, Studies in Logic and Practical Reasoning, vol. 3, pp. 991\u20131029. Elsevier (2007). https:\/\/doi.org\/10.1016\/S1570-2464(07)80021-8. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1570246407800218","DOI":"10.1016\/S1570-2464(07)80021-8"},{"key":"25_CR20","unstructured":"Murawski, A.S.: On semantic and type-theoretic aspects of polynomial-time computability (2001)"},{"key":"25_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/3-540-45413-6_28","volume-title":"Typed Lambda Calculi and Applications","author":"AS Murawski","year":"2001","unstructured":"Murawski, A.S., Luke Ong, C.-H.: Evolving games and essential nets for affine polymorphism. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol. 2044, pp. 360\u2013375. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45413-6_28"},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"Plotkin, G., Stirling, C.: A framework for intuitionistic modal logics. In: Proceedings of the 1st Conference on Theoretical Aspects of Reasoning about Knowledge (TARK), pp. 399\u2013406 (1986)","DOI":"10.1016\/B978-0-934613-04-0.50032-6"},{"key":"25_CR23","volume-title":"Natural Deduction: A Proof-Theoretical Study","author":"D Prawitz","year":"2006","unstructured":"Prawitz, D.: Natural Deduction: A Proof-Theoretical Study. Courier Dover Publications, Mineola (2006)"},{"key":"25_CR24","unstructured":"Simpson, A.K.: The proof theory and semantics of intuitionistic modal logic. Ph.D. thesis, University of Edinburgh, College of Science and Engineering (1994)"},{"key":"25_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-37075-5_14","volume-title":"Foundations of Software Science and Computation Structures","author":"L Stra\u00dfburger","year":"2013","unstructured":"Stra\u00dfburger, L.: Cut elimination in nested sequents for intuitionistic modal logics. In: Pfenning, F. (ed.) FoSSaCS 2013. LNCS, vol. 7794, pp. 209\u2013224. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37075-5_14"},{"key":"25_CR26","doi-asserted-by":"publisher","unstructured":"Stra\u00dfburger, L., Heijltjes, W., Hughes, D.J.D.: Intuitionistic proofs without syntax. In: 34th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2019, Vancouver, Canada, pp. 1\u201313. IEEE, June 2019. https:\/\/doi.org\/10.1109\/LICS.2019.8785827. https:\/\/hal.inria.fr\/hal-02386878","DOI":"10.1109\/LICS.2019.8785827"},{"key":"25_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139168717","volume-title":"Basic Proof Theory","author":"AS Troelstra","year":"2000","unstructured":"Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory, vol. 43. Cambridge University Press, Cambridge (2000)"},{"key":"25_CR28","first-page":"433","volume":"90","author":"D Vakarelov","year":"1991","unstructured":"Vakarelov, D.: Modal logics for knowledge representation systems. Theor. Comput. Sci. 90, 433\u2013456 (1991)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning with Analytic Tableaux and Related Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86059-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T10:24:57Z","timestamp":1673173497000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86059-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030860585","9783030860592"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86059-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"30 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TABLEAUX","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Automated Reasoning with Analytic Tableaux and Related Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Birmingham","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tableaux2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tableaux2021.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}