{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:54:23Z","timestamp":1763643263101,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"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_24","type":"book-chapter","created":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T17:48:17Z","timestamp":1630432097000},"page":"409-427","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Nested Sequents for Intuitionistic Modal Logics via Structural Refinement"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3214-0828","authenticated-orcid":false,"given":"Tim S.","family":"Lyon","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,30]]},"reference":[{"key":"24_CR1","unstructured":"Bierman, G.M., de Paiva, V.C.V.: On an intuitionistic modal logic. Stud. Log. Int. J. Symb. Log. 65(3), 383\u2013416 (2000). http:\/\/www.jstor.org\/stable\/20016199"},{"key":"24_CR2","doi-asserted-by":"publisher","unstructured":"Br\u00fcnnler, K.: Deep sequent systems for modal logic. Arch. Math. Log. 48(6), 551\u2013577 (2009). https:\/\/doi.org\/10.1007\/s00153-009-0137-3","DOI":"10.1007\/s00153-009-0137-3"},{"issue":"2","key":"24_CR3","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1002\/malq.19920380107","volume":"38","author":"RA Bull","year":"1992","unstructured":"Bull, R.A.: Cut elimination for propositional dynamic logic without *. Z. Math. Logik Grundlag. Math. 38(2), 85\u2013100 (1992)","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Castilho, M.A., del Cerro, L.F., Gasquet, O., Herzig, A.: Modal tableaux with propagation rules and structural rules. Fundam. Inform. 32(3, 4), 281\u2013297 (1997)","DOI":"10.3233\/FI-1997-323404"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-319-72056-2_8","volume-title":"Logical Foundations of Computer Science","author":"A Ciabattoni","year":"2018","unstructured":"Ciabattoni, A., Lyon, T., Ramanayake, R.: From display to labelled proofs for tense logics. In: Artemov, S., Nerode, A. (eds.) LFCS 2018. LNCS, vol. 10703, pp. 120\u2013139. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-72056-2_8"},{"issue":"3","key":"24_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3460492","volume":"22","author":"A Ciabattoni","year":"2021","unstructured":"Ciabattoni, A., Lyon, T., Ramanayake, R., Tiu, A.: Display to labelled proofs and back again for tense logics. ACM Trans. Comput. Log. 22(3), 1\u201331 (2021). https:\/\/doi.org\/10.1145\/3460492","journal-title":"ACM Trans. Comput. Log."},{"key":"24_CR7","doi-asserted-by":"publisher","unstructured":"Davies, R., Pfenning, F.: A modal analysis of staged computation. J. ACM 48(3), 555\u2013604 (2001). https:\/\/doi.org\/10.1145\/382780.382785","DOI":"10.1145\/382780.382785"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BFb0022268","volume-title":"Computer Science Logic","author":"M Fairtlough","year":"1995","unstructured":"Fairtlough, M., Mendler, M.: An intuitionistic modal logic with applications to the formal verification of hardware. In: Pacholski, L., Tiuryn, J. (eds.) CSL 1994. LNCS, vol. 933, pp. 354\u2013368. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0022268"},{"key":"24_CR9","unstructured":"Fitch, F.B.: Intuitionistic modal logic with quantifiers. Portugaliae Math. 7(2), 113\u2013118 (1948). http:\/\/eudml.org\/doc\/114664"},{"issue":"2","key":"24_CR10","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1305\/ndjfl\/1093894722","volume":"13","author":"M Fitting","year":"1972","unstructured":"Fitting, M.: Tableau methods of proof for modal logics. Notre Dame J. Form. Log. 13(2), 237\u2013247 (1972)","journal-title":"Notre Dame J. Form. Log."},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Fitting, M.: Proof Methods for Modal and Intuitionistic Logics, vol. 169. Springer Science & Business Media, Heidelberg (1983)","DOI":"10.1007\/978-94-017-2794-5"},{"issue":"3","key":"24_CR12","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/j.apal.2014.11.002","volume":"166","author":"M Fitting","year":"2015","unstructured":"Fitting, M., Kuznets, R.: Modal interpolation via nested sequents. Ann. Pure Appl. Logic 166(3), 274\u2013305 (2015). https:\/\/doi.org\/10.1016\/j.apal.2014.11.002","journal-title":"Ann. Pure Appl. Logic"},{"issue":"4","key":"24_CR13","doi-asserted-by":"publisher","first-page":"373","DOI":"10.3166\/jancl.20.373-421","volume":"20","author":"D Galmiche","year":"2010","unstructured":"Galmiche, D., Salhi, Y.: Label-free natural deduction systems for intuitionistic and classical modal logics. J. Appl. Non-Class. Log. 20(4), 373\u2013421 (2010). https:\/\/doi.org\/10.3166\/jancl.20.373-421","journal-title":"J. Appl. Non-Class. Log."},{"key":"24_CR14","doi-asserted-by":"publisher","unstructured":"Galmiche, D., Salhi, Y.: Tree-sequent calculi and decision procedures for intuitionistic modal logics. J. Log. Comput. 28(5), 967\u2013989 (2015). https:\/\/doi.org\/10.1093\/logcom\/exv039","DOI":"10.1093\/logcom\/exv039"},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-030-51054-1_25","volume-title":"Automated Reasoning","author":"M Girlando","year":"2020","unstructured":"Girlando, M., Stra\u00dfburger, L.: MOIN: a nested sequent theorem prover for intuitionistic modal logics (system description). In: Peltier, N., Sofronie-Stokkermans, V. (eds.) IJCAR 2020. LNCS (LNAI), vol. 12167, pp. 398\u2013407. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51054-1_25"},{"key":"24_CR16","unstructured":"Gor\u00e9, R., Postniece, L., Tiu, A.: Cut-elimination and proof-search for bi-intuitionistic logic using nested sequents. In: Areces, C., Goldblatt, R. (eds.) Advances in Modal Logic 7, papers from the seventh conference on \u201cAdvances in Modal Logic,\u201d held in Nancy, France, 9\u201312 September 2008, pp. 43\u201366. College Publications (2008). http:\/\/www.aiml.net\/volumes\/volume7\/Gore-Postniece-Tiu.pdf"},{"key":"24_CR17","doi-asserted-by":"publisher","unstructured":"Gor\u00e9, R., Postniece, L., Tiu, A.: On the correspondence between display postulates and deep inference in nested sequent calculi for tense logics. Log. Methods Comput. Sci. 7(2), 1\u201338 (2011). https:\/\/doi.org\/10.2168\/LMCS-7(2:8)2011","DOI":"10.2168\/LMCS-7(2:8)2011"},{"key":"24_CR18","unstructured":"Gor\u00e9, R., Ramanayake, R.: Labelled tree sequents, tree hypersequents and nested (deep) sequents. In: Bolander, T., Bra\u00fcner, T., Ghilardi, S., Moss, L.S. (eds.) Advances in Modal Logic 9, papers from the ninth conference on \u201cAdvances in Modal Logic,\u201d held in Copenhagen, Denmark, 22\u201325 August 2012, pp. 279\u2013299. College Publications (2012). http:\/\/www.aiml.net\/volumes\/volume9\/Gore-Ramanayake.pdf"},{"issue":"1","key":"24_CR19","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BF01053026","volume":"53","author":"R Kashima","year":"1994","unstructured":"Kashima, R.: Cut-free sequent calculi for some tense logics. Stud. Log. 53(1), 119\u2013135 (1994)","journal-title":"Stud. Log."},{"key":"24_CR20","unstructured":"Lemmon, E.J., Scott, D.S.: An Introduction to Modal Logic: The Lemmon Notes. Blackwell, Oxford (1977)"},{"key":"24_CR21","doi-asserted-by":"publisher","unstructured":"Lyon, T.: On the correspondence between nested calculi and semantic systems for intuitionistic logics. J. Log. Comput. 31(1), 213\u2013265 (2020). https:\/\/doi.org\/10.1093\/logcom\/exaa078","DOI":"10.1093\/logcom\/exaa078"},{"key":"24_CR22","unstructured":"Lyon, T.: Refining Labelled Systems for Modal and Constructive Logics with Applications. Ph.D. thesis, Technische Universit\u00e4t Wien (2021)"},{"key":"24_CR23","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-030-33792-6_13","volume-title":"PRIMA 2019: Principles and Practice of Multi-Agent Systems","author":"T Lyon","year":"2019","unstructured":"Lyon, T., van Berkel, K.: Automating agential reasoning: proof-calculi and syntactic decidability for STIT logics. In: Baldoni, M., Dastani, M., Liao, B., Sakurai, Y., Zalila Wenkstern, R. (eds.) PRIMA 2019. LNCS (LNAI), vol. 11873, pp. 202\u2013218. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-33792-6_13"},{"key":"24_CR24","doi-asserted-by":"publisher","unstructured":"Lyon, T., Tiu, A., Gor\u00e9, R., Clouston, R.: Syntactic interpolation for tense logics and bi-intuitionistic logic via nested sequents. In: Fern\u00e1ndez, M., Muscholl, A. (eds.) 28th EACSL Annual Conference on Computer Science Logic, CSL 2020, 13\u201316 January 2020, Barcelona, Spain. LIPIcs, vol. 152, pp. 28:1\u201328:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2020.28","DOI":"10.4230\/LIPIcs.CSL.2020.28"},{"key":"24_CR25","unstructured":"Marin, S., Stra\u00dfburger, L.: Label-free modular systems for classical and intuitionistic modal logics. In: Advances in Modal Logic 10, invited and contributed papers from the Tenth Conference on \u201cAdvances in Modal Logic,\u201d held in Groningen, The Netherlands, 5\u20138 August 2014, pp. 387\u2013406 (2014). http:\/\/www.aiml.net\/volumes\/volume10\/Marin-Strassburger.pdf"},{"key":"24_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-662-57669-4_3","volume-title":"Logic, Language, Information, and Computation","author":"E Pimentel","year":"2018","unstructured":"Pimentel, E.: A semantical view of proof systems. In: Moss, L.S., de Queiroz, R., Martinez, M. (eds.) WoLLIC 2018. LNCS, vol. 10944, pp. 61\u201376. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-662-57669-4_3"},{"key":"24_CR27","doi-asserted-by":"publisher","unstructured":"Pitts, A.M.: Evaluation logic. In: Birtwistle, G. (eds.) IV Higher Order Workshop, Banff 1990, pp. 162\u2013189. Workshops in Computing. Springer, London (1991). https:\/\/doi.org\/10.1007\/978-1-4471-3182-3_11","DOI":"10.1007\/978-1-4471-3182-3_11"},{"key":"24_CR28","doi-asserted-by":"crossref","unstructured":"Plotkin, G., Stirling, C.: A framework for intuitionistic modal logics: Extended abstract. In: Proceedings of the 1986 Conference on Theoretical Aspects of Reasoning about Knowledge, pp. 399\u2013406. TARK 1986, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (1986)","DOI":"10.1016\/B978-0-934613-04-0.50032-6"},{"issue":"1","key":"24_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2267170","volume":"12","author":"EL Post","year":"1947","unstructured":"Post, E.L.: Recursive unsolvability of a problem of Thue. J. Symb. Log. 12(1), 1\u201311 (1947)","journal-title":"J. Symb. Log."},{"issue":"3","key":"24_CR30","first-page":"179","volume":"42","author":"GF Servi","year":"1984","unstructured":"Servi, G.F.: Axiomatizations for some intuitionistic modal logics. Rend. Sem. Mat. Univers. Politec. Torino 42(3), 179\u2013194 (1984)","journal-title":"Rend. Sem. Mat. Univers. Politec. Torino"},{"key":"24_CR31","unstructured":"Simpson, A.K.: The proof theory and semantics of intuitionistic modal logic. Ph.D. thesis, University of Edinburgh. College of Science and Engineering. School of Informatics (1994)"},{"key":"24_CR32","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":"24_CR33","unstructured":"Tiu, A., Ianovski, E., Gor\u00e9, R.: Grammar logics in nested sequent calculus: proof theory and decision procedures. In: Bolander, T., Bra\u00fcner, T., Ghilardi, S., Moss, L.S. (eds.) Advances in Modal Logic 9, papers from the ninth conference on \u201cAdvances in Modal Logic,\u201d held in Copenhagen, Denmark, 22\u201325 August 2012, pp. 516\u2013537. College Publications (2012). http:\/\/www.aiml.net\/volumes\/volume9\/Tiu-Ianovski-Gore.pdf"}],"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_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T17:56:30Z","timestamp":1630432590000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86059-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030860585","9783030860592"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86059-2_24","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)"}}]}}