{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T10:45:17Z","timestamp":1774953917161,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030290252","type":"print"},{"value":"9783030290269","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-29026-9_9","type":"book-chapter","created":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T23:10:06Z","timestamp":1566429006000},"page":"147-165","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Sequentialising Nested Systems"],"prefix":"10.1007","author":[{"given":"Elaine","family":"Pimentel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Revantha","family":"Ramanayake","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bj\u00f6rn","family":"Lellmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,14]]},"reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0890-5401(91)90023-U","volume":"92","author":"Arnon Avron","year":"1991","unstructured":"Avron, A.: Simple consequence relations. Inf. Comput. 92(1), 105\u2013140 (1991). https:\/\/doi.org\/10.1016\/0890-5401(91)90023-U","journal-title":"Information and Computation"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Avron, A.: The method of hypersequents in the proof theory of propositional non-classical logics. In: Logic: From Foundations to Applications (Staffordshire, 1993), Oxford Science Publishing, pp. 1\u201332. Oxford University Press, New York (1996)","DOI":"10.1093\/oso\/9780198538622.003.0001"},{"key":"9_CR3","first-page":"107","volume-title":"Advances in Modal Logic","author":"K Br\u00fcnnler","year":"2006","unstructured":"Br\u00fcnnler, K.: Deep sequent systems for modal logic. In: Governatori, G., Hodkinson, I., Venema, Y. (eds.) Advances in Modal Logic, vol. 6, pp. 107\u2013119. College Publications, London (2006)"},{"key":"9_CR4","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)","journal-title":"Arch. Math. Log."},{"key":"9_CR5","unstructured":"Chaudhuri, K., Marin, S., Stra\u00dfburger, L.: Modular focused proof systems for intuitionistic modal logics. In: FSCD, pp. 16:1\u201316:18 (2016)"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Fitting, M.: Proof methods for modal and intuitionistic logics. In: Synthese Library, vol. 169. Reidel Publishing Company, Dordrecht (1983)","DOI":"10.1007\/978-94-017-2794-5"},{"issue":"1","key":"9_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. Form. Log. 55(1), 41\u201361 (2014)","journal-title":"Notre Dame J. Form. Log."},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Gentzen, G.: Investigations into logical deduction. In: The Collected Papers of Gerhard Gentzen, pp. 68\u2013131 (1969)","DOI":"10.1016\/S0049-237X(08)70822-X"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/3-540-44802-0_5","volume-title":"Computer Science Logic","author":"A Guglielmi","year":"2001","unstructured":"Guglielmi, A., Stra\u00dfburger, L.: Non-commutativity and MELL in the calculus of structures. In: Fribourg, L. (ed.) CSL 2001. LNCS, vol. 2142, pp. 54\u201368. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44802-0_5"},{"issue":"1","key":"9_CR10","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. Studia Logica 53(1), 119\u2013135 (1994)","journal-title":"Studia Logica"},{"issue":"4","key":"9_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2528930","volume":"14","author":"Ori Lahav","year":"2013","unstructured":"Lahav, O., Avron, A.: A unified semantic framework for fully structural propositional sequent systems. ACM Trans. Comput. Log. 14(4), 27:1\u201327:33 (2013). http:\/\/doi.acm.org\/10.1145\/2528930","journal-title":"ACM Transactions on Computational Logic"},{"issue":"3","key":"9_CR12","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s11787-017-0175-2","volume":"11","author":"Ori Lahav","year":"2017","unstructured":"Lahav, O., Marcos, J., Zohar, Y.: Sequent systems for negative modalities. Logica Universalis 11(3), 345\u2013382 (2017). https:\/\/doi.org\/10.1007\/s11787-017-0175-2","journal-title":"Logica Universalis"},{"key":"9_CR13","unstructured":"Lellmann, B.: Sequent calculi with context restrictions and applications to conditional logic. Ph.D. thesis, Imperial College London (2013). http:\/\/hdl.handle.net\/10044\/1\/18059"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-319-24312-2_10","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"B Lellmann","year":"2015","unstructured":"Lellmann, B.: Linear nested sequents, 2-sequents and hypersequents. In: De Nivelle, H. (ed.) TABLEAUX 2015. LNCS (LNAI), vol. 9323, pp. 135\u2013150. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24312-2_10"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-642-40537-2_19","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"B Lellmann","year":"2013","unstructured":"Lellmann, B., Pattinson, D.: Correspondence between modal Hilbert axioms and sequent rules with an application to S5. In: Galmiche, D., Larchey-Wendling, D. (eds.) TABLEAUX 2013. LNCS (LNAI), vol. 8123, pp. 219\u2013233. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40537-2_19"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Lellmann, B., Pimentel, E.: Modularisation of sequent calculi for normal and non-normal modalities. ACM Trans. Comput. Log. 29 (2019). Article No. 7","DOI":"10.1145\/3288757"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1017\/S0027763000018055","volume":"7","author":"S Maehara","year":"1954","unstructured":"Maehara, S.: Eine Darstellung der intuitionistischen Logik in der klassischen. Nagoya Math. J. 7, 45\u201364 (1954)","journal-title":"Nagoya Math. J."},{"issue":"6","key":"9_CR18","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1023\/A:1017948105274","volume":"26","author":"G Mints","year":"1997","unstructured":"Mints, G.: Indexed systems of sequents and cut-elimination. J. Philos. Logic 26(6), 671\u2013696 (1997)","journal-title":"J. Philos. Logic"},{"key":"9_CR19","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":"9_CR20","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":"9_CR21","first-page":"900","volume":"48","author":"G Pottinger","year":"1983","unstructured":"Pottinger, G.: Uniform, cut-free formulations of $$t$$ , $$s4$$ and $$s5$$ (abstract). J. Symbolic Logic 48, 900\u2013901 (1983)","journal-title":"J. Symbolic Logic"},{"key":"9_CR22","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":"9_CR23","volume-title":"and Helmut Schwichtenberg. Basic Proof Theory","author":"AS Troelstra","year":"1996","unstructured":"Troelstra, A.S., Schwichtenberg, H.: and Helmut Schwichtenberg. Basic Proof Theory. Cambridge University Press, Cambridge (1996)"},{"key":"9_CR24","volume-title":"Labelled Non-classical Logics","author":"V Luca","year":"2000","unstructured":"Luca, V.: Labelled Non-classical Logics. Kluwer, Dordrecht (2000)"},{"key":"9_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-010-0387-2_2","volume-title":"Handbook of Philosophical Logic","author":"H Wansing","year":"2002","unstructured":"Wansing, H.: Sequent systems for modal logics. In: Gabbay, D.M., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol. 8. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/978-94-010-0387-2_2"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning with Analytic Tableaux and Related Methods"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29026-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T10:54:49Z","timestamp":1721645689000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-29026-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030290252","9783030290269"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29026-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 August 2019","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":"London","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tableaux2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tableaux2019.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":"43","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":"58% - 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.2","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":"3","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)"}}]}}