{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,19]],"date-time":"2026-08-19T18:24:12Z","timestamp":1787163852216,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030888527","type":"print"},{"value":"9783030888534","type":"electronic"}],"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-88853-4_24","type":"book-chapter","created":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T22:37:39Z","timestamp":1633473459000},"page":"388-407","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Pure View of Ecumenical Modalities"],"prefix":"10.1007","author":[{"given":"Sonia","family":"Marin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luiz Carlos","family":"Pereira","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Elaine","family":"Pimentel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Emerson","family":"Sales","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,10,6]]},"reference":[{"key":"24_CR1","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. Log. 48, 551\u2013577 (2009). https:\/\/doi.org\/10.1007\/s00153-009-0137-3","journal-title":"Arch. Math. Log."},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Bull, R.: Cut elimination for propositional dynamic logic without*. Zeitschr. f. math. Logik und Grundlagen d. Math. 38, 85\u2013100 (1992)","DOI":"10.1002\/malq.19920380107"},{"key":"24_CR3","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107050884","volume-title":"Modal Logic","author":"P Blackburn","year":"2001","unstructured":"Blackburn, P., de Rijke, M., de Venema, Y.: Modal Logic. Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, Cambridge (2001)"},{"key":"24_CR4","unstructured":"Chaudhuri, K., Marin, S., Stra\u00dfburger, L.: Modular focused proof systems for intuitionistic modal logics. In: FSCD 2016, no. 16, pp. 1\u201318 (2016)"},{"key":"24_CR5","unstructured":"D\u00edaz-Caro, A., Dowek, G.: A new connective in natural deduction, and its application to quantum computing. CoRR, abs\/2012.08994 (2020)"},{"key":"24_CR6","volume-title":"The Logical Basis of Metaphysics","author":"M Dummett","year":"1991","unstructured":"Dummett, M.: The Logical Basis of Metaphysics. Harvard University Press, Cambridge (1991)"},{"issue":"1","key":"24_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1215\/00294527-2377869","volume":"55","author":"M Fitting","year":"2014","unstructured":"Fitting, M.: Nested sequents for intuitionistic logics. Notre Dame J. Formal Logic 55(1), 41\u201361 (2014)","journal-title":"Notre Dame J. Formal Logic"},{"key":"24_CR8","first-page":"279","volume":"9","author":"R Gor\u00e9","year":"2012","unstructured":"Gor\u00e9, R., Ramanayake, R.: Labelled tree sequents, tree hypersequents and nested (deep) sequents. Adv. Modal Logic 9, 279\u2013299 (2012)","journal-title":"Adv. Modal Logic"},{"issue":"3","key":"24_CR9","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1017\/S0960129500001328","volume":"1","author":"J-Y Girard","year":"1991","unstructured":"Girard, J.-Y.: A new constructive logic: classical logic. Math. Struct. Comput. Sci. 1(3), 255\u2013296 (1991)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"3","key":"24_CR10","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0168-0072(93)90093-S","volume":"59","author":"J-Y Girard","year":"1993","unstructured":"Girard, J.-Y.: On the unity of logic. Ann. Pure Appl. Logic 59(3), 201\u2013217 (1993)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"11","key":"24_CR11","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1016\/j.apal.2010.04.007","volume":"161","author":"D Ilik","year":"2010","unstructured":"Ilik, D., Lee, G., Herbelin, H.: Kripke models for classical logic. Ann. Pure Appl. Logic 161(11), 1367\u20131378 (2010)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1","key":"24_CR12","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. Logica 53(1), 119\u2013136 (1994)","journal-title":"Stud. Logica"},{"key":"24_CR13","unstructured":"Laurent, O.: \u00c9tude de la Polarisation en Logique. Ph.D. thesis, Universit\u00e9 Aix-Marseille II (2002)"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-030-29026-9_12","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"B Lellmann","year":"2019","unstructured":"Lellmann, B.: Combining monotone and normal modal logic in nested sequents \u2013 with countermodels. In: Cerrito, S., Popescu, A. (eds.) TABLEAUX 2019. LNCS (LNAI), vol. 11714, pp. 203\u2013220. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29026-9_12"},{"issue":"9","key":"24_CR15","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1016\/j.apal.2011.01.012","volume":"162","author":"C Liang","year":"2011","unstructured":"Liang, C., Miller, D.: A focused approach to combining logics. Ann. Pure Appl. Logic 162(9), 679\u2013697 (2011)","journal-title":"Ann. Pure Appl. Logic"},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.tcs.2012.12.008","volume":"474","author":"D Miller","year":"2013","unstructured":"Miller, D., Pimentel, E.: A formal framework for specifying sequent calculus proof systems. Theor. Comput. Sci. 474, 98\u2013116 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-030-65840-3_12","volume-title":"Dynamic Logic. New Trends and Applications","author":"S Marin","year":"2020","unstructured":"Marin, S., Pereira, L.C., Pimentel, E., Sales, E.: Ecumenical modal logic. In: Martins, M.A., Sedl\u00e1r, I. (eds.) DaL\u00ed 2020. LNCS, vol. 12569, pp. 187\u2013204. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-65840-3_12"},{"key":"24_CR18","unstructured":"Olarte, C., Pimentel, E., Rocha, C.: A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems. CoRR, abs\/2101.03113 (2021)"},{"key":"24_CR19","series-title":"Trends in Logic","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-1-4020-9084-4_3","volume-title":"Towards Mathematical Philosophy","author":"F Poggiolesi","year":"2009","unstructured":"Poggiolesi, F.: The method of tree-hypersequents for\u00a0modal\u00a0propositional\u00a0logic. In: Makinson, D., Malinowski, J., Wansing, H. (eds.) Towards Mathematical Philosophy. TL, vol. 28, pp. 31\u201351. Springer, Dordrecht (2009). https:\/\/doi.org\/10.1007\/978-1-4020-9084-4_3"},{"key":"24_CR20","doi-asserted-by":"publisher","unstructured":"Pimentel, E., Pereira, L.C., de Paiva, V.: An ecumenical notion of entailment. Synthese (2019). https:\/\/doi.org\/10.1007\/s11229-019-02226-5","DOI":"10.1007\/s11229-019-02226-5"},{"issue":"3\u20133","key":"24_CR21","first-page":"1153","volume":"73","author":"LC Pereira","year":"2017","unstructured":"Pereira, L.C., Rodriguez, R.O.: Normalization, soundness and completeness for the propositional fragment of Prawitz\u2019 ecumenical system. Rev. Port. Filos. 73(3\u20133), 1153\u20131168 (2017)","journal-title":"Rev. Port. Filos."},{"key":"24_CR22","unstructured":"Prawitz, D.: Classical versus intuitionistic logic. Why is this a Proof? Festschrift for Luiz Carlos Pereira, 27, 15\u201332 (2015)"},{"key":"24_CR23","doi-asserted-by":"crossref","unstructured":"Plotkin, G.D., Stirling, C.P.: A framework for intuitionistic modal logic. In: Halpern, J.Y. (ed.) 1st Conference on Theoretical Aspects of Reasoning About Knowledge. Morgan Kaufmann, Burlington (1986)","DOI":"10.1016\/B978-0-934613-04-0.50032-6"},{"key":"24_CR24","unstructured":"Restall, G.: Comparing Modal Sequent Systems. Draft manuscript (2006)"},{"key":"24_CR25","doi-asserted-by":"crossref","unstructured":"Sahlqvist, H.: Completeness and correspondence in first and second order semantics for modal logic. In: Kanger, S. (eds.) Proceedings of the Third Scandinavian Logic Symposium, pp. 110\u2013143 (1975)","DOI":"10.1016\/S0049-237X(08)70728-6"},{"key":"24_CR26","unstructured":"Simpson, A.K.: The proof theory and semantics of intuitionistic modal logic. Ph.D. thesis, College of Science and Engineering, School of Informatics, University of Edinburgh (1994)"},{"key":"24_CR27","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_CR28","volume-title":"Basic Proof Theory","author":"AS Troelstra","year":"1996","unstructured":"Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory. Cambridge Univ. Press, Cambridge (1996)"}],"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-030-88853-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T22:47:36Z","timestamp":1633474056000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-88853-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030888527","9783030888534"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-88853-4_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"6 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WoLLIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Logic, Language, Information, and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wollic2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wollic.org\/wollic2021\/","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":"50","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":"25","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":"3","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":"8","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)"}}]}}