Abstract
AbstractThis paper establishes cut-elimination for $$\mathsf {\mu LL^\infty }$$, $$\mathsf {\mu LK^\infty }$$ and $$\mathsf {\mu LJ^\infty }$$, that are non-wellfounded sequent calculi with least and greatest fixed-points, by expanding on prior works by Santocanale and Fortier [20] as well as Baelde et al. [3, 4]. The paper studies a fixed-point encoding of $$\textsf{LL}$$ exponentials in order to deduce those cut-elimination results from that of $$\mathsf {\mu MALL^\infty }$$. Cut-elimination for $$\mathsf {\mu LK^\infty }$$ and $$\mathsf {\mu LJ^\infty }$$ is obtained by developing appropriate linear decorations for those logics.
Publisher
Springer Nature Switzerland
Reference31 articles.
1. 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–44, 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
2. Baelde, D.: Least and greatest fixed points in linear logic. ACM Trans. Comput. Logic 13(1) (2012). https://doi.org/10.1145/2071368.2071370
3. 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–63:13. ACM (2022)
4. 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–42:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016). http://www.dagstuhl.de/dagpub/978-3-95977-022-4
5. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);D Baelde,2007