{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T18:53:57Z","timestamp":1790016837332,"version":"4.0.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662576687","type":"print"},{"value":"9783662576694","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-662-57669-4_3","type":"book-chapter","created":{"date-parts":[[2018,6,26]],"date-time":"2018-06-26T04:48:51Z","timestamp":1529988531000},"page":"61-76","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A Semantical View of Proof Systems"],"prefix":"10.1007","author":[{"given":"Elaine","family":"Pimentel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,6,27]]},"reference":[{"key":"3_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)","journal-title":"Arch. Math. Log."},{"key":"3_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511621192","volume-title":"Modal Logic","author":"BF Chellas","year":"1980","unstructured":"Chellas, B.F.: Modal Logic. Cambridge University Press, Cambridge (1980)"},{"issue":"1\u20132","key":"3_CR3","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s00153-011-0254-7","volume":"51","author":"R Dyckhoff","year":"2012","unstructured":"Dyckhoff, R., Negri, S.: Proof analysis in intermediate logics. Arch. Math. Log. 51(1\u20132), 71\u201392 (2012)","journal-title":"Arch. Math. Log."},{"issue":"1","key":"3_CR4","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 Log. 55(1), 41\u201361 (2014)","journal-title":"Notre Dame J. Formal Log."},{"key":"3_CR5","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":"3_CR6","unstructured":"Gor\u00e9, R., Ramanayake, R.: Labelled tree sequents, tree hypersequents and nested (deep) sequents. In: AiML, vol. 9, pp. 279\u2013299 (2012)"},{"issue":"3","key":"3_CR7","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s11787-017-0175-2","volume":"11","author":"O 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":"3_CR8","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":"3_CR9","doi-asserted-by":"crossref","unstructured":"Lellmann, B., Olarte, C., Pimentel, E.: A uniform framework for substructural logics with modalities. In: LPAR-21, pp. 435\u2013455 (2017)","DOI":"10.29007\/93qg"},{"key":"3_CR10","unstructured":"Lellmann, B., Pimentel, E.: Modularisation of sequent calculi for normal and non-normal modalities. CoRR abs\/1702.08193 (2017)"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Lellmann, B., Pimentel, E., Ramanayake, R.: Sequentialising nested systems (2018, submitted). https:\/\/sites.google.com\/site\/elainepimentel\/home\/publications---elaine-pimentel","DOI":"10.1007\/978-3-030-29026-9_9"},{"key":"3_CR12","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":"3_CR13","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. Phil. Log. 26(6), 671\u2013696 (1997)","journal-title":"J. Phil. Log."},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s10992-005-2267-3","volume":"34","author":"S Negri","year":"2005","unstructured":"Negri, S.: Proof analysis in modal logic. J. Phil. Log. 34, 507\u2013544 (2005)","journal-title":"J. Phil. Log."},{"issue":"4","key":"3_CR15","first-page":"1241","volume":"4","author":"S Negri","year":"2017","unstructured":"Negri, S.: Proof theory for non-normal modal logics: the neighbourhood formalism and basic results. IfCoLog J. Log. Appl. 4(4), 1241\u20131286 (2017)","journal-title":"IfCoLog J. Log. Appl."},{"key":"3_CR16","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 modal propositional logic. 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":"3_CR17","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":"3_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3208-5","volume-title":"Labelled Non-classical Logics","author":"L Vigan\u00f2","year":"2000","unstructured":"Vigan\u00f2, L.: Labelled Non-classical Logics. Kluwer, Alphen aan den Rijn (2000)"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-57669-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T05:52:43Z","timestamp":1751694763000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-57669-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783662576687","9783662576694"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-57669-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}