{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T08:10:22Z","timestamp":1726042222761},"publisher-location":"Cham","reference-count":46,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030290061"},{"type":"electronic","value":"9783030290078"}],"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-29007-8_16","type":"book-chapter","created":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T23:10:06Z","timestamp":1566429006000},"page":"277-294","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Two Is Enough \u2013 Bisequent Calculus for S5"],"prefix":"10.1007","author":[{"given":"Andrzej","family":"Indrzejczak","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,14]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"939","DOI":"10.2307\/2273828","volume":"52","author":"A Avron","year":"1987","unstructured":"Avron, A.: A constructive analysis of RM. J. Symb. Log. 52, 939\u2013951 (1987)","journal-title":"J. Symb. Log."},{"key":"16_CR2","first-page":"1","volume-title":"Logic: From Foundations to Applications","author":"A Avron","year":"1996","unstructured":"Avron, A.: The method of hypersequents in the proof theory of propositional non-classical logics. In: Hodges, W., et al. (eds.) Logic: From Foundations to Applications, pp. 1\u201332. Oxford Science Publication, Oxford (1996)"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1023\/A:1005060022386","volume":"60","author":"A Avron","year":"1998","unstructured":"Avron, A., Honsell, F., Miculan, M., Paravano, C.: Encoding modal logics in logical frameworks. Stud. Log. 60, 161\u2013202 (1998)","journal-title":"Stud. Log."},{"key":"16_CR4","unstructured":"Avron, A., Lahav, O.: A simple cut-free system of paraconsistent logic equivalent to S5. In: Bezhanishvili, G., et al. (eds.) Advances in Modal Logic, vol. 12, pp. 29\u201342. College Publications (2018)"},{"key":"16_CR5","unstructured":"Baaz, M., Ferm\u00fcller, C.G., Zach, R.: Dual systems of sequents and tableaux for many-valued logics. Technical report TUW-E185.2-BFZ, 2\u201392 (1992)"},{"key":"16_CR6","unstructured":"Baelde, D., Lick, A., Schmitz, S.: A hypersequent calculus with clusters for linear frames. In: Bezhanishvili, G., et al. (eds.) Advances in Modal Logic, vol. 12, pp. 43\u201362. College Publications (2018)"},{"issue":"3","key":"16_CR7","first-page":"277","volume":"24","author":"K Bednarska","year":"2015","unstructured":"Bednarska, K., Indrzejczak, A.: Hypersequent calculi for S5 - the methods of cut-elimination. Log. Log. Philos. 24(3), 277\u2013311 (2015)","journal-title":"Log. Log. Philos."},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"763","DOI":"10.2977\/prims\/1195169271","volume":"27","author":"S Blamey","year":"1991","unstructured":"Blamey, S., Humberstone, L.: A perspective on modal sequent logic. Publications of the Research Institute for Mathematical Sciences, Kyoto University 27, 763\u2013782 (1991)","journal-title":"Publications of the Research Institute for Mathematical Sciences, Kyoto University"},{"key":"16_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-007-0002-4","volume-title":"Hybrid Logic and its Proof-Theory","author":"T Bra\u00fcner","year":"2009","unstructured":"Bra\u00fcner, T.: Hybrid Logic and its Proof-Theory. Springer, Roskilde (2009). https:\/\/doi.org\/10.1007\/978-94-007-0002-4"},{"issue":"6","key":"16_CR10","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(6), 551\u2013571 (2009)","journal-title":"Arch. Math. Log."},{"key":"16_CR11","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 star. Z. f\u00fcr Math. Log. Und Grundl. Math. 38, 85\u2013100 (1992)","journal-title":"Z. f\u00fcr Math. Log. Und Grundl. Math."},{"issue":"6","key":"16_CR12","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1007\/s11225-014-9566-z","volume":"102","author":"A Ciabattoni","year":"2014","unstructured":"Ciabattoni, A., Ramanayake, R., Wansing, H.: Hypersequent and display calculi - a unified perspective. Stud. Log. 102(6), 1245\u20131294 (2014)","journal-title":"Stud. Log."},{"key":"16_CR13","volume-title":"A Theory of Formal Deducibility","author":"HB Curry","year":"1950","unstructured":"Curry, H.B.: A Theory of Formal Deducibility. University of Notre Dame Press, Notre Dame (1950)"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"149","DOI":"10.2307\/2273797","volume":"50","author":"K Dos\u0306en","year":"1985","unstructured":"Dos\u0306en, K.: Sequent-systems for modal logic. J. Symb. Log. 50, 149\u2013159 (1985)","journal-title":"J. Symb. Log."},{"key":"16_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-2794-5","volume-title":"Proof Methods for Modal and Intuitionistic Logics","author":"M Fitting","year":"1983","unstructured":"Fitting, M.: Proof Methods for Modal and Intuitionistic Logics. Reidel, Dordrecht (1983)"},{"key":"16_CR16","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. Log. 163, 291\u2013313 (2012)","journal-title":"Ann. Pure Appl. Log."},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-94-009-6259-0_5","volume-title":"Handbook of Philosophical Logic","author":"JW Garson","year":"1984","unstructured":"Garson, J.W.: Quantification in modal logic. In: Gabbay, D., Guenther, F. (eds.) Handbook of Philosophical Logic, vol. II, pp. 249\u2013308. Kluwer, Dordrecht (1984)"},{"key":"16_CR18","volume-title":"Proof Theory and Logical Complexity","author":"JY Girard","year":"1987","unstructured":"Girard, J.Y.: Proof Theory and Logical Complexity. Bibliopolis, Napoli (1987)"},{"key":"16_CR19","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198539896.001.0001","volume-title":"Automated Deduction in Multiple-Valued Logics","author":"R H\u00e4hnle","year":"1994","unstructured":"H\u00e4hnle, R.: Automated Deduction in Multiple-Valued Logics. Oxford University Press, Oxford (1994)"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/3-540-61208-4_14","volume-title":"Theorem Proving with Analytic Tableaux and Related Methods","author":"A Heuerding","year":"1996","unstructured":"Heuerding, A., Seyfried, M., Zimmermann, H.: Efficient loop-check for backward proof search in some non-classical propositional logics. In: Miglioli, P., Moscato, U., Mundici, D., Ornaghi, M. (eds.) TABLEAUX 1996. LNCS, vol. 1071, pp. 210\u2013225. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61208-4_14"},{"issue":"3","key":"16_CR21","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1093\/jigpal\/6.3.505","volume":"6","author":"A Indrzejczak","year":"1998","unstructured":"Indrzejczak, A.: Cut-free double sequent calculus for S5. Log. J. IGPL 6(3), 505\u2013516 (1998)","journal-title":"Log. J. IGPL"},{"key":"16_CR22","first-page":"15","volume":"1","author":"A Indrzejczak","year":"1997","unstructured":"Indrzejczak, A.: Generalised sequent calculus for propositional modal logics. Log. Trianguli 1, 15\u201331 (1997)","journal-title":"Log. Trianguli"},{"key":"16_CR23","unstructured":"Indrzejczak, A.: Multiple Sequent Calculus for Tense Logics. Abstracts of AiML and ICTL 2000, Leipzig, pp. 93\u2013104 (2000)"},{"key":"16_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-90-481-8785-0","volume-title":"Natural Deduction, Hybrid Systems and Modal Logics","author":"A Indrzejczak","year":"2010","unstructured":"Indrzejczak, A.: Natural Deduction, Hybrid Systems and Modal Logics. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-90-481-8785-0"},{"issue":"2","key":"16_CR25","first-page":"125","volume":"45","author":"A Indrzejczak","year":"2016","unstructured":"Indrzejczak, A.: Simple decision procedure for S5 in standard cut-free sequent calculus. Bull. Sect. Log. 45(2), 125\u2013140 (2016)","journal-title":"Bull. Sect. Log."},{"issue":"1","key":"16_CR26","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1017\/bsl.2016.2","volume":"22","author":"A Indrzejczak","year":"2016","unstructured":"Indrzejczak, A.: Linear time in hypersequent framework. Bull. Symb. Log. 22(1), 121\u2013144 (2016)","journal-title":"Bull. Symb. Log."},{"key":"16_CR27","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, 119\u2013135 (1994)","journal-title":"Stud. Log."},{"key":"16_CR28","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-319-10061-6_4","volume-title":"New Frontiers in Artificial Intelligence","author":"H Kurokawa","year":"2014","unstructured":"Kurokawa, H.: Hypersequent calculi for modal logics extending S4. In: Nakano, Y., Satoh, K., Bekki, D. (eds.) JSAI-isAI 2013. LNCS (LNAI), vol. 8417, pp. 51\u201368. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10061-6_4"},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"Lahav O.: From frame properties to hypersequent rules in modal logics. In: Proceedings of LICS, pp. 408\u2013417. Springer (2013)","DOI":"10.1109\/LICS.2013.47"},{"key":"16_CR30","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":"16_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4020-9409-5","volume-title":"Proof Theory for Fuzzy Logics","author":"G Metcalfe","year":"2008","unstructured":"Metcalfe, G., Olivetti, N., Gabbay, D.: Proof Theory for Fuzzy Logics. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-1-4020-9409-5"},{"key":"16_CR32","first-page":"88","volume":"98","author":"G Mints","year":"1968","unstructured":"Mints, G.: Some calculi of modal logic [in Russian]. Trudy Mat. Inst. Steklov. 98, 88\u2013111 (1968)","journal-title":"Trudy Mat. Inst. Steklov."},{"key":"16_CR33","unstructured":"Mints G.: Systems of Lewis and system T\u2019 [in Russian], Supplement to Russian edition. In: Feys, R. (ed.) Modal Logic, Nauka, pp. 422\u2013509 (1974)"},{"key":"16_CR34","volume-title":"Selected Papers in Proof Theory","author":"G Mints","year":"1992","unstructured":"Mints, G.: Selected Papers in Proof Theory. North-Holland, Amsterdam (1992)"},{"key":"16_CR35","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511527340","volume-title":"Structural Proof Theory","author":"S Negri","year":"2001","unstructured":"Negri, S., von Plato, J.: Structural Proof Theory. Cambridge University Press, Cambridge (2001)"},{"key":"16_CR36","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. Philos. Log. 34, 507\u2013544 (2005)","journal-title":"J. Philos. Log."},{"key":"16_CR37","first-page":"113","volume":"9","author":"M Ohnishi","year":"1957","unstructured":"Ohnishi, M., Matsumoto, K.: Gentzen method in modal calculi I. Osaka Math. J. 9, 113\u2013130 (1957)","journal-title":"Osaka Math. J."},{"key":"16_CR38","doi-asserted-by":"publisher","DOI":"10.1007\/978-90-481-9670-8","volume-title":"Gentzen Calculi for Modal Propositional Logic","author":"F Poggiolesi","year":"2011","unstructured":"Poggiolesi, F.: Gentzen Calculi for Modal Propositional Logic. Springer, Heidelberg (2011)"},{"key":"16_CR39","first-page":"900","volume":"48","author":"G Pottinger","year":"1983","unstructured":"Pottinger, G.: Uniform cut-free formulations of T, S4 and S5 (abstract). J. Symb. Log. 48, 900 (1983)","journal-title":"J. Symb. Log."},{"key":"16_CR40","first-page":"151","volume":"28","author":"G Restall","year":"2007","unstructured":"Restall, G.: Proofnets for S5: sequents and circuits for modal logic. Lect. Notes Log. 28, 151\u2013172 (2007)","journal-title":"Lect. Notes Log."},{"key":"16_CR41","doi-asserted-by":"publisher","first-page":"381","DOI":"10.2977\/prims\/1195189814","volume":"13","author":"M Sato","year":"1977","unstructured":"Sato, M.: A study of kripke-type models for some modal logics by Gentzen\u2019s sequential method. Publ. Res. Inst. Math. Sci. Kyoto Univ. 13, 381\u2013468 (1977)","journal-title":"Publ. Res. Inst. Math. Sci. Kyoto Univ."},{"key":"16_CR42","unstructured":"Serebriannikov, O.: Gentzen\u2019s Hauptsatz for modal logic with quantifiers. In: Niniluoto, I., Saarinen, E. (eds.) Intensional Logic: Theory and Applications; Acta Philosophica Fennica, vol. 35, pp. 79\u201388 (1982)"},{"key":"16_CR43","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s11225-007-9028-y","volume":"85","author":"P Stouppa","year":"2007","unstructured":"Stouppa, P.: A deep inference system for the modal logic S5. Stud. Log. 85, 199\u2013214 (2007)","journal-title":"Stud. Log."},{"key":"16_CR44","volume-title":"Displaying Modal Logics","author":"H Wansing","year":"1999","unstructured":"Wansing, H.: Displaying Modal Logics. Kluwer Academic Publishers, Dordrecht (1999)"},{"key":"16_CR45","first-page":"89","volume-title":"Handbook of Philosophical Logic","author":"H Wansing","year":"2002","unstructured":"Wansing, H.: Sequent systems for modal logics. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol. IV, pp. 89\u2013133. Reidel Publishing Company, Dordrecht (2002)"},{"key":"16_CR46","unstructured":"Zeman, J.: Modal Logic. Oxford University Press, Oxford (1973)"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29007-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T10:55:18Z","timestamp":1721645718000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-29007-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030290061","9783030290078"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29007-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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":"FroCoS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Frontiers of Combining Systems","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":"4 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"frocos2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.frocos2019.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":"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":"20","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":"67% - 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.1","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)"}}]}}