3 papers
cs.LO2025
Proceedings Twelfth Workshop on Fixed Points in Computer Science
Alexis Saurin
This EPTCS volume contains the post-proceedings of the Twelfth International Workshop on Fixed Points in Computer Science, presenting a selection of the works presented during the…
cs.LO2025
A uniform cut-elimination theorem for linear logics with fixed points and super exponentials
Esaïe Bauer, Alexis Saurin
In the realm of light logics deriving from linear logic, a number of variants of exponential rules have been investigated. The profusion of such proof systems induces the need for…
cs.LO2025
On the cut-elimination of the modal -calculus: Linear Logic to the rescue
Esaïe Bauer, Alexis Saurin
This paper presents a proof-theoretic analysis of the modal -calculus. More precisely, we prove a syntactic cut-elimination for the non-wellfounded modal -calculus, using m…