2 papers
cs.LO2025
Non-wellfounded parsimonious proofs and non-uniform complexity
Matteo Acclavio, Gianluca Curzi, Giulio Guerrieri
In this paper we investigate the complexity-theoretical aspects of cyclic and non-wellfounded proofs in the context of parsimonious logic, a variant of linear logic where the expon…
cs.LO2025
Infinitary Cut-Elimination for Non-Wellfounded Parsimonious Linear Logic
Matteo Acclavio, Gianluca Curzi, Giulio Guerrieri
We investigate non-wellfounded proof systems based on parsimonious logic, a weaker variant of linear logic where the exponential modality ! is interpreted as a constructor for stre…