{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,28]],"date-time":"2025-12-28T02:20:58Z","timestamp":1766888458850,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031435126"},{"type":"electronic","value":"9783031435133"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T00:00:00Z","timestamp":1694649600000},"content-version":"vor","delay-in-days":256,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper establishes cut-elimination for <jats:inline-formula><jats:tex-math>$$\\mathsf {\\mu LL^\\infty }$$<\/jats:tex-math><\/jats:inline-formula>, <jats:inline-formula><jats:tex-math>$$\\mathsf {\\mu LK^\\infty }$$<\/jats:tex-math><\/jats:inline-formula> and <jats:inline-formula><jats:tex-math>$$\\mathsf {\\mu LJ^\\infty }$$<\/jats:tex-math><\/jats:inline-formula>, that are non-wellfounded sequent calculi with least and greatest fixed-points, by expanding on prior works by Santocanale and Fortier\u00a0[20] as well as Baelde et al.\u00a0[3, 4]. The paper studies a fixed-point encoding of <jats:inline-formula><jats:tex-math>$$\\textsf{LL}$$<\/jats:tex-math><\/jats:inline-formula> exponentials in order to deduce those cut-elimination results from that of <jats:inline-formula><jats:tex-math>$$\\mathsf {\\mu MALL^\\infty }$$<\/jats:tex-math><\/jats:inline-formula>. Cut-elimination for <jats:inline-formula><jats:tex-math>$$\\mathsf {\\mu LK^\\infty }$$<\/jats:tex-math><\/jats:inline-formula> and <jats:inline-formula><jats:tex-math>$$\\mathsf {\\mu LJ^\\infty }$$<\/jats:tex-math><\/jats:inline-formula> is obtained by developing appropriate linear decorations for those logics.<\/jats:p>","DOI":"10.1007\/978-3-031-43513-3_12","type":"book-chapter","created":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T14:02:36Z","timestamp":1694613756000},"page":"203-222","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A Linear Perspective on\u00a0Cut-Elimination for\u00a0Non-wellfounded Sequent Calculi with\u00a0Least and\u00a0Greatest Fixed-Points"],"prefix":"10.1007","author":[{"given":"Alexis","family":"Saurin","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,14]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","unstructured":"Afshari, B., Leigh, G.E.: On closure ordinals for the modal mu-calculus. In Rocca, S.R.D., (eds), Computer Science Logic 2013 (CSL 2013). vol. 23 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 30\u201344, Dagstuhl, Germany (2013). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2013\/4188, https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2013.30","DOI":"10.4230\/LIPIcs.CSL.2013.30"},{"key":"12_CR2","doi-asserted-by":"publisher","unstructured":"Baelde, D.: Least and greatest fixed points in linear logic. ACM Trans. Comput. Logic 13(1) (2012). https:\/\/doi.org\/10.1145\/2071368.2071370","DOI":"10.1145\/2071368.2071370"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Baelde, D., Doumane, A., Kuperberg, D., Saurin, A.: Bouncing threads for circular and non-wellfounded proofs: towards compositionality with circular proofs. In: Proceedings of the 37th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS), pp. 63:1\u201363:13. ACM (2022)","DOI":"10.1145\/3531130.3533375"},{"key":"12_CR4","unstructured":"Baelde, D., Doumane, A., Saurin, A.: Infinitary proof theory: the multiplicative additive case. In: 25th EACSL Annual Conference on Computer Science Logic, CSL 2016, August 29 - September 1, 2016, Marseille, France, volume 62 of LIPIcs, pp. 42:1\u201342:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016). http:\/\/www.dagstuhl.de\/dagpub\/978-3-95977-022-4"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-75560-9_9","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"D Baelde","year":"2007","unstructured":"Baelde, D., Miller, D.: Least and greatest fixed points in linear logic. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol. 4790, pp. 92\u2013106. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75560-9_9"},{"key":"12_CR6","unstructured":"Brotherston, J.: Sequent Calculus Proof Systems for Inductive Definitions. PhD thesis, University of Edinburgh, November 2006"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-642-22438-6_12","volume-title":"Automated Deduction \u2013 CADE-23","author":"J Brotherston","year":"2011","unstructured":"Brotherston, J., Distefano, D., Petersen, R.L.: Automated cyclic entailment proofs in separation logic. In: Bj\u00f8rner, N., Sofronie-Stokkermans, V. (eds.) CADE 2011. LNCS (LNAI), vol. 6803, pp. 131\u2013146. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22438-6_12"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-642-35182-2_25","volume-title":"Programming Languages and Systems","author":"J Brotherston","year":"2012","unstructured":"Brotherston, J., Gorogiannis, N., Petersen, R.L.: A generic cyclic theorem prover. In: Jhala, R., Igarashi, A. (eds.) APLAS 2012. LNCS, vol. 7705, pp. 350\u2013367. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35182-2_25"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Brotherston, J., Simpson, A.: Complete sequent calculi for induction and infinite descent. In: 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), pp. 51\u201362. IEEE (2007)","DOI":"10.1109\/LICS.2007.16"},{"issue":"6","key":"12_CR10","doi-asserted-by":"publisher","first-page":"1177","DOI":"10.1093\/logcom\/exq052","volume":"21","author":"J Brotherston","year":"2011","unstructured":"Brotherston, J., Simpson, A.: Sequent calculi for induction and infinite descent. J. Logic Comput. 21(6), 1177\u20131216 (2011)","journal-title":"J. Logic Comput."},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Br\u00fcnnler, K., Studer, T.: Syntactic cut-elimination for a fragment of the modal mu-calculus. Ann. Pure Appl. Logic 163(12), 1838\u20131853 (2012). https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0168007212000760, https:\/\/doi.org\/10.1016\/j.apal.2012.04.006","DOI":"10.1016\/j.apal.2012.04.006"},{"issue":"3","key":"12_CR12","doi-asserted-by":"publisher","first-page":"755","DOI":"10.2307\/2275572","volume":"62","author":"V Danos","year":"1997","unstructured":"Danos, V., Joinet, J.-B., Schellinx, H.: A new deconstructive logic: linear logic. J. Symb. Log. 62(3), 755\u2013807 (1997)","journal-title":"J. Symb. Log."},{"key":"12_CR13","unstructured":"Das, A.: A circular version of G\u00f6del\u2019s T and its abstraction complexity. CoRR, abs\/2012.14421 (2020)"},{"key":"12_CR14","unstructured":"Das, A.: Personal communication, June 2023"},{"key":"12_CR15","unstructured":"Das, A., Pous, D.: Non-wellfounded proof theory for (Kleene+action)(algebras+lattices). In: Annual Conference for Computer Science Logic (CSL). vol. 119 of LIPIcs, pp. 19:1\u201319:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/11944836_26","volume-title":"FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science","author":"C Dax","year":"2006","unstructured":"Dax, C., Hofmann, M., Lange, M.: A proof system for the linear time $$\\mu $$-calculus. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, pp. 273\u2013284. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11944836_26"},{"key":"12_CR17","doi-asserted-by":"publisher","unstructured":"Doumane, A.: Constructive completeness for the linear-time $$\\mu $$-calculus. In: 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, 20\u201323 June 2017, pp. 1\u201312. IEEE Computer Society (2017). https:\/\/doi.org\/10.1109\/LICS.2017.8005075","DOI":"10.1109\/LICS.2017.8005075"},{"key":"12_CR18","unstructured":"Doumane, A.: On the infinitary proof theory of logics with fixed points. PhD thesis, Paris Diderot University (2017)"},{"key":"12_CR19","unstructured":"Endrullis, J., Hansen, H.H., Hendriks, D., Polonsky, A., Silva, A.: Coinductive foundations of infinitary rewriting and infinitary equational logic. Log. Methods Comput. Sci. 14(1) (2018). https:\/\/doi.org\/10.23638\/LMCS-14(1:3)2018"},{"key":"12_CR20","unstructured":"Fortier, J., Santocanale, L.: Cuts for circular proofs: semantics and cut-elimination. In: Rocca, S.R.D. (eds.) Computer Science Logic 2013 (CSL 2013), CSL 2013, 2\u20135 September 2013, Torino, Italy, volume 23 of LIPIcs, pp. 248\u2013262. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2013)"},{"issue":"1","key":"12_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J-Y Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. Theor. Comput. Sci. 50(1), 1\u2013101 (1987). https:\/\/doi.org\/10.1016\/0304-3975(87)90045-4","journal-title":"Theor. Comput. Sci."},{"key":"12_CR22","doi-asserted-by":"publisher","unstructured":"Kozen, D.: Results on the propositional $$\\mu $$-calculus. Theor. Comput. Sci. 27(3), 333\u2013354 (1983). Special Issue Ninth International Colloquium on Automata, Languages and Programming (ICALP) Aarhus, Summer (1982). http:\/\/www.sciencedirect.com\/science\/article\/pii\/0304397582901256, https:\/\/doi.org\/10.1016\/0304-3975(82)90125-6","DOI":"10.1016\/0304-3975(82)90125-6"},{"issue":"3","key":"12_CR23","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF00370554","volume":"47","author":"D Kozen","year":"1988","unstructured":"Kozen, D.: A finite model theorem for the propositional $$\\mu $$-calculus. Studia Logica 47(3), 233\u2013241 (1988). https:\/\/doi.org\/10.1007\/BF00370554","journal-title":"Studia Logica"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Kuperberg, D., Pinault, L., Pous, D.: Cyclic proofs, system T, and the power of contraction. Proc. ACM Program. Lang. 5, 1\u201328 (2021)","DOI":"10.1145\/3434282"},{"key":"12_CR25","doi-asserted-by":"publisher","unstructured":"Martin-L\u00f6f, P.: Hauptsatz for the intuitionistic theory of iterated inductive definitions. In: Fenstad, J.E. (edn.) Proceedings of the Second Scandinavian Logic Symposium. vol. 63 of Studies in Logic and the Foundations of Mathematics, pp. 179\u2013216. Elsevier (1971). https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0049237X08708474, https:\/\/doi.org\/10.1016\/S0049-237X(08)70847-4","DOI":"10.1016\/S0049-237X(08)70847-4"},{"key":"12_CR26","unstructured":"Melli\u00e8s, P.-A.: Categorical semantics of linear logic. In: Interactive models of computation and program behavior, Panoramas et Synth\u00e8ses, pp. 213. Soci\u00e9t\u00e9 Math\u00e9matique de France (2009)"},{"key":"12_CR27","unstructured":"Pinault, L.: From automata to cyclic proofs : equivalence algorithms and descriptive complexity. (Des automates aux preuves cycliques : algorithmes d\u2019\u00e9quivalence et complexit\u00e9 descriptive). PhD thesis, University of Lyon, France (2021)"},{"key":"12_CR28","doi-asserted-by":"publisher","unstructured":"Rowe, R.N.S., Brotherston, J.: Automatic cyclic termination proofs for recursive procedures in separation logic. In: Bertot, Y., Vafeiadis, V., (eds). Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, CPP 2017, Paris, France, 16\u201317 January 2017, pp. 53\u201365. ACM (2017). https:\/\/doi.org\/10.1145\/3018610.3018623","DOI":"10.1145\/3018610.3018623"},{"key":"12_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/3-540-45931-6_25","volume-title":"Foundations of Software Science and Computation Structures","author":"L Santocanale","year":"2002","unstructured":"Santocanale, L.: A calculus of circular proofs and its categorical semantics. In: Nielsen, M., Engberg, U. (eds.) FoSSaCS 2002. LNCS, vol. 2303, pp. 357\u2013371. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45931-6_25"},{"key":"12_CR30","unstructured":"Saurin, A.: A linear perspective on cut-elimination for non-wellfounded sequent calculi with least and greatest fixed points (extended version). long version of the present paper (2023). https:\/\/hal.science\/hal-04169137"},{"key":"12_CR31","unstructured":"Terese. Term Rewriting Systems. vol. 55 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press (2003)"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning with Analytic Tableaux and Related Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43513-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T14:04:50Z","timestamp":1694613890000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43513-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031435126","9783031435133"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43513-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"14 September 2023","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":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tableaux2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/tableaux2023.tableaux-ar.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":"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":"5","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":"47% - 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.92)","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)"}}]}}