{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:21:38Z","timestamp":1743117698894,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030367541"},{"type":"electronic","value":"9783030367558"}],"license":[{"start":{"date-parts":[[2019,12,20]],"date-time":"2019-12-20T00:00:00Z","timestamp":1576800000000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-36755-8_12","type":"book-chapter","created":{"date-parts":[[2019,12,16]],"date-time":"2019-12-16T15:05:16Z","timestamp":1576508716000},"page":"177-194","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On Deriving Nested Calculi for Intuitionistic Logics from Semantic Systems"],"prefix":"10.1007","author":[{"given":"Tim","family":"Lyon","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,12,20]]},"reference":[{"key":"12_CR1","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 Publications, pp. 1\u201332. Oxford University Press, New York (1996)","DOI":"10.1093\/oso\/9780198538622.003.0001"},{"issue":"4","key":"12_CR2","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/BF00284976","volume":"11","author":"ND Belnap Jr","year":"1982","unstructured":"Belnap Jr., N.D.: Display logic. J. Philos. Logic 11(4), 375\u2013417 (1982)","journal-title":"J. Philos. Logic"},{"issue":"6","key":"12_CR3","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":"2","key":"12_CR4","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 $$\\ast $$. Z. Math. Logik Grundlag. Math. 38(2), 85\u2013100 (1992)","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"12_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"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-40537-2_9","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"A Ciabattoni","year":"2013","unstructured":"Ciabattoni, A., Maffezioli, P., Spendier, L.: Hypersequent and labelled calculi for intermediate logics. In: Galmiche, D., Larchey-Wendling, D. (eds.) TABLEAUX 2013. LNCS (LNAI), vol. 8123, pp. 81\u201396. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40537-2_9"},{"issue":"1\u20132","key":"12_CR7","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. Logic 51(1\u20132), 71\u201392 (2012)","journal-title":"Arch. Math. Logic"},{"issue":"2","key":"12_CR8","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. Formal Logic 13(2), 237\u2013247 (1972). https:\/\/doi.org\/10.1305\/ndjfl\/1093894722","journal-title":"Notre Dame J. Formal Logic"},{"issue":"3","key":"12_CR9","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.apal.2011.09.004","volume":"163","author":"M Fitting","year":"2012","unstructured":"Fitting, M.: Prefixed tableaus and nested sequents. Ann. Pure Appl. Logic 163(3), 291\u2013313 (2012). https:\/\/doi.org\/10.1016\/j.apal.2011.09.004 . http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0168007211001266","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1","key":"12_CR10","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":"12_CR11","volume-title":"Quantification in Non-classical Logics. Studies in Logic and Foundations of Mathematics","author":"D Gabbay","year":"2009","unstructured":"Gabbay, D., Shehtman, V., Skvortsov, D.: Quantification in Non-classical Logics. Studies in Logic and Foundations of Mathematics. Elsevier, Amsterdam (2009)"},{"issue":"3","key":"12_CR12","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/BF01201363","volume":"39","author":"G Gentzen","year":"1935","unstructured":"Gentzen, G.: Untersuchungen uber das logische schliessen. Math. Z. 39(3), 405\u2013431 (1935)","journal-title":"Math. Z."},{"key":"12_CR13","doi-asserted-by":"crossref","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), 2:8, 38 (2011)","DOI":"10.2168\/LMCS-7(2:8)2011"},{"key":"12_CR14","unstructured":"Gor\u00e9, R., Ramanayake, R.: Labelled tree sequents, Tree hypersequents and Nested (Deep) Sequents. Advances in modal logic , Vol. 9. College Publications (2012)"},{"issue":"1","key":"12_CR15","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\u2013135 (1994)","journal-title":"Stud. Logica."},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Lyon, T.: On deriving nested calculi for intuitionistic logics from semantic systems. https:\/\/arxiv.org\/abs\/1910.06576 (2019)","DOI":"10.1007\/978-3-030-36755-8_12"},{"key":"12_CR17","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":"12_CR18","unstructured":"Lyon, T., Tiu, A., G\u00f3re, 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), Leibniz International Proceedings in Informatics (LIPIcs), vol. 152. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2020). Forthcoming"},{"issue":"2","key":"12_CR19","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1093\/logcom\/exu037","volume":"26","author":"S Negri","year":"2016","unstructured":"Negri, S.: Proof analysis beyond geometric theories: from rule systems to systems of rules. J. Logic Comput. 26(2), 513\u2013537 (2016). https:\/\/doi.org\/10.1093\/logcom\/exu037","journal-title":"J. Logic Comput."},{"key":"12_CR20","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.) Logic, Language, Information, and Computation, WoLLIC 2018. LNCS, vol. 10944, pp. 61\u201376. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-662-57669-4_3 . ISBN 978-3-662-57669-4"},{"issue":"1","key":"12_CR21","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1017\/S1755020308080040","volume":"1","author":"F Poggiolesi","year":"2008","unstructured":"Poggiolesi, F.: A cut-free simple sequent calculus for modal logic $$s5$$. Rev. Symb. Logic 1(1), 3\u201315 (2008)","journal-title":"Rev. Symb. Logic"},{"key":"12_CR22","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":"12_CR23","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"},{"key":"12_CR24","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 Academic Publishers, Dordrecht (2000). With a foreword by Dov M. Gabbay"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36755-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,28]],"date-time":"2024-07-28T18:15:10Z","timestamp":1722190510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36755-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,20]]},"ISBN":["9783030367541","9783030367558"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36755-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019,12,20]]},"assertion":[{"value":"20 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LFCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Logical Foundations of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Deerfield Beach, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 January 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 January 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lfcs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lfcs.ws.gc.cuny.edu\/lfcs-2020\/","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":"30","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":"17","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":"57% - 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.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":"3.7","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}