{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:46:01Z","timestamp":1763642761459,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"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_11","type":"book-chapter","created":{"date-parts":[[2019,12,16]],"date-time":"2019-12-16T10:05:16Z","timestamp":1576490716000},"page":"156-176","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Syntactic Cut-Elimination for Intuitionistic Fuzzy Logic via Linear Nested Sequents"],"prefix":"10.1007","author":[{"given":"Tim","family":"Lyon","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,12,20]]},"reference":[{"issue":"3","key":"11_CR1","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF01531058","volume":"4","author":"A Avron","year":"1991","unstructured":"Avron, A.: Hypersequents, logical consequence and intermediate logics for concurrency. Ann. Math. Artif. Intell. 4(3), 225\u2013248 (1991). \nhttps:\/\/doi.org\/10.1007\/BF01531058","journal-title":"Ann. Math. Artif. Intell."},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-642-02261-6_10","volume-title":"Logic, Language, Information and Computation","author":"M Baaz","year":"2009","unstructured":"Baaz, M., Ciabattoni, A., Preining, N.: SAT in monadic g\u00f6del logics: a borderline between decidability and undecidability. In: Ono, H., Kanazawa, M., de Queiroz, R. (eds.) WoLLIC 2009. LNCS (LNAI), vol. 5514, pp. 113\u2013123. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-02261-6_10"},{"issue":"1-2","key":"11_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.apal.2007.03.001","volume":"147","author":"Matthias Baaz","year":"2007","unstructured":"Baaz, M., Preining, N., Zach, R.: First-order g\u00f6del logics. Ann. Pure Appl. Logic 147(1), 23\u201347 (2007). \nhttps:\/\/doi.org\/10.1016\/j.apal.2007.03.001\n\n. URL \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S016800720700019X","journal-title":"Annals of Pure and Applied Logic"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/3-540-44622-2_12","volume-title":"Computer Science Logic","author":"M Baaz","year":"2000","unstructured":"Baaz, M., Zach, R.: Hypersequents and the proof theory of intuitionistic fuzzy logic. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol. 1862, pp. 187\u2013201. Springer, Heidelberg (2000). \nhttps:\/\/doi.org\/10.1007\/3-540-44622-2_12"},{"issue":"4","key":"11_CR5","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. Log. 11(4), 375\u2013417 (1982)","journal-title":"J. Philos. Log."},{"key":"11_CR6","unstructured":"Borgwardt, S., Distel, F., Pe\u00f1aloza, R.: Decidable G\u00f6del description logics without the finitely-valued model property. In: Baral, C., De Giacomo, G., Eiter, T. (eds.) Proceedings of the 14th International Conference on Principles of Knowledge Representation and Reasoning (KR 2014), pp. 228\u2013237. AAAI Press (2014)"},{"issue":"2","key":"11_CR7","doi-asserted-by":"publisher","first-page":"97","DOI":"10.2307\/2964753","volume":"24","author":"M Dummett","year":"1959","unstructured":"Dummett, M.: A propositional calculus with denumerable matrix. J. Symb. Log. 24(2), 97\u2013106 (1959). \nhttp:\/\/www.jstor.org\/stable\/2964753","journal-title":"J. Symb. Log."},{"issue":"1","key":"11_CR8","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). \nhttps:\/\/doi.org\/10.1215\/00294527-2377869","journal-title":"Notre Dame J. Form. Log."},{"key":"11_CR9","series-title":"Studies in Logic and Foundations of Mathematics","volume-title":"Quantification in Non-classical Logics","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":"11_CR10","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":"11_CR11","first-page":"65","volume":"69","author":"K G\u00f6del","year":"1932","unstructured":"G\u00f6del, K.: Zum intuitionistischen aussagenkalk\u00fcl. Anzeiger der Akademie der Wissenschaften in Wien 69, 65\u201366 (1932)","journal-title":"Anzeiger der Akademie der Wissenschaften in Wien"},{"key":"11_CR12","unstructured":"Gor\u00e9, R., Postniece, L., Tiu, A.: Cut-elimination and proof-search for bi-intuitionistic logic using nested sequents. In: Areces, C., Goldblatt, R. (eds.) Advances in Modal Logic 7, Papers from the Seventh Conference on \u201cAdvances in Modal Logic,\u201d held in Nancy, France, 9\u201312 September 2008, pp. 43\u201366. College Publications (2008). \nhttp:\/\/www.aiml.net\/volumes\/volume7\/Gore-Postniece-Tiu.pdf"},{"key":"11_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-5300-3","volume-title":"The Metamathematics of Fuzzy Logic","author":"P Hajek","year":"1998","unstructured":"Hajek, P.: The Metamathematics of Fuzzy Logic. Kluwer, Dordrecht (1998)"},{"issue":"3","key":"11_CR14","doi-asserted-by":"publisher","first-page":"395","DOI":"10.2307\/2270905","volume":"34","author":"A Horn","year":"1969","unstructured":"Horn, A.: Logic with truth values in a linearly ordered heyting algebra. J. Symb. Log. 34(3), 395\u2013408 (1969). \nhttp:\/\/www.jstor.org\/stable\/2270905","journal-title":"J. Symb. Log."},{"key":"11_CR15","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). \nhttps:\/\/doi.org\/10.1007\/978-3-319-24312-2_10"},{"key":"11_CR16","unstructured":"Lellmann, B.: LNSprover: modular theorem proving with linear nested sequents (2016). \nhttps:\/\/www.logic.at\/staff\/lellmann\/lnsprover\/"},{"key":"11_CR17","unstructured":"Lellmann, B., Kuznets, R.: Interpolation for intermediate logics via hyper- and linear nested sequents. In: Advances in Modal Logic, vol. 12, pp. 473\u2013492 (2018)"},{"issue":"4","key":"11_CR18","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1145\/383779.383783","volume":"2","author":"V Lifschitz","year":"2001","unstructured":"Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Trans. Comput. Log. 2(4), 526\u2013541 (2001). \nhttps:\/\/doi.org\/10.1145\/383779.383783","journal-title":"ACM Trans. Comput. Log."},{"key":"11_CR19","unstructured":"Lyon, T.: Syntactic cut-elimination for intuitionistic fuzzy logic via linear nested sequents (2019). \nhttps:\/\/arxiv.org\/abs\/1910.06657"},{"key":"11_CR20","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). \nhttps:\/\/doi.org\/10.1007\/978-3-030-33792-6_13"},{"key":"11_CR21","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":"3","key":"11_CR22","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0168-0072(92)90029-Y","volume":"58","author":"A Masini","year":"1992","unstructured":"Masini, A.: 2-sequent calculus: a proof theory of modalities. Ann. Pure Appl. Log. 58(3), 229\u2013246 (1992). \nhttps:\/\/doi.org\/10.1016\/0168-0072(92)90029-Y\n\n. \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/016800729290029Y","journal-title":"Ann. Pure Appl. Log."},{"issue":"5","key":"11_CR23","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1093\/logcom\/3.5.533","volume":"3","author":"A Masini","year":"1993","unstructured":"Masini, A.: 2-sequent calculus: intuitionism and natural deduction. J. Log. Comput. 3(5), 533\u2013562 (1993). \nhttps:\/\/doi.org\/10.1093\/logcom\/3.5.533","journal-title":"J. Log. Comput."},{"issue":"1","key":"11_CR24","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. Log. 1(1), 3\u201315 (2008). \nhttps:\/\/doi.org\/10.1017\/S1755020308080040","journal-title":"Rev. Symb. Log."},{"issue":"3","key":"11_CR25","doi-asserted-by":"publisher","first-page":"851","DOI":"10.2307\/2274139","volume":"49","author":"G Takeuti","year":"1984","unstructured":"Takeuti, G., Titani, S.: Intuitionistic fuzzy logic and intuitionistic fuzzy set theory. J. Symb. Log. 49(3), 851\u2013866 (1984). \nhttps:\/\/doi.org\/10.2307\/2274139","journal-title":"J. Symb. Log."},{"key":"11_CR26","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"},{"issue":"3","key":"11_CR27","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0003-4843(82)90024-9","volume":"22","author":"A Visser","year":"1982","unstructured":"Visser, A.: On the completenes principle: a study of provability in heyting\u2019s arithmetic and extensions. Ann. Math. Log. 22(3), 263\u2013295 (1982). \nhttps:\/\/doi.org\/10.1016\/0003-4843(82)90024-9\n\n. \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/0003484382900249","journal-title":"Ann. Math. Log."},{"issue":"2","key":"11_CR28","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1093\/logcom\/4.2.125","volume":"4","author":"H Wansing","year":"1994","unstructured":"Wansing, H.: Sequent calculi for normal modal propositional logics. J. Log. Comput. 4(2), 125\u2013142 (1994). \nhttps:\/\/doi.org\/10.1093\/logcom\/4.2.125","journal-title":"J. Log. Comput."}],"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_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,19]],"date-time":"2019-12-19T19:04:03Z","timestamp":1576782243000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36755-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,20]]},"ISBN":["9783030367541","9783030367558"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36755-8_11","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)"}}]}}