Cover Image

Infinitary Cut-Elimination for Non-Wellfounded Parsimonious Linear Logic

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Acclavio, Matteo, Curzi, Gianluca, Guerrieri, Giulio
Format:	Preprint
Published:	2023
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Non-wellfounded parsimonious proofs and non-uniform complexity
by: Acclavio, Matteo, et al.
Published: (2024)

Compression for Coinductive Infinitary Rewriting: A Generic Approach, with Applications to Cut-Elimination for Non-Wellfounded Proofs
by: Cerda, Rémy, et al.
Published: (2025)

Making progress: Reducibility Candidates and Cut Elimination in the Ill-founded Realm
by: Curzi, Gianluca, et al.
Published: (2026)

Probabilistic Linear Logic Programming with an Application to Bayesian Network Computations (Extended Version)
by: Acclavio, Matteo, et al.
Published: (2026)

Logic Programming with Multiplicative Structures
by: Acclavio, Matteo, et al.
Published: (2024)

On Propositional Dynamic Logic and Concurrency
by: Acclavio, Matteo, et al.
Published: (2024)

Graphical Proof Theory I: Sequent Systems on Undirected Graphs
by: Acclavio, Matteo
Published: (2023)

Cyclic Implicit Complexity
by: Curzi, Gianluca, et al.
Published: (2021)

A Non-Wellfounded and Labelled Sequent Calculus for Bimodal Provability Logic
by: Becker, Justus
Published: (2025)

Hyperarithmetical Complexity of Infinitary Action Logic with Multiplexing
by: Pshenitsyn, Tikhon
Published: (2023)

On the Cut Elimination of Weak Intuitionistic Tense Logic
by: Wang, Yiheng, et al.
Published: (2024)

The Constructive $μ$-calculus: Game Semantics and Non-Wellfounded Proof Systems
by: Pacheco, Leonardo
Published: (2026)

Coalgebraic Non-Wellfounded Proofs: Recursiveness and GTC
by: Kori, Mayuko
Published: (2026)

Computational expressivity of (circular) proofs with fixed points
by: Curzi, Gianluca, et al.
Published: (2023)

Cyclic proof theory of positive inductive definitions
by: Curzi, Gianluca, et al.
Published: (2025)

Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
by: Accattoli, Beniamino
Published: (2022)

Cut-Elimination for the Bimodal Logic GR
by: Kushida, Hirohiko
Published: (2026)

Proof Nets for PiL (Full Version)
by: Acclavio, Matteo, et al.
Published: (2026)

Intuitionistic BV (Extended version)
by: Acclavio, Matteo, et al.
Published: (2025)

Proofs as Execution Trees for the π-Calculus
by: Acclavio, Matteo, et al.
Published: (2024)

IMELL Cut Elimination with Linear Overhead
by: Accattoli, Beniamino, et al.
Published: (2024)

Proof Identity and Categorical Models of BV
by: Acclavio, Matteo, et al.
Published: (2026)

Formulas as Processes, Deadlock-Freedom as Choreographies (Extended Version)
by: Acclavio, Matteo, et al.
Published: (2025)

Syntactic Cut-Elimination for Provability Logic GL via Nested Sequents
by: Maniwa, Akinori, et al.
Published: (2024)

CoLF Logic Programming as Infinitary Proof Exploration
by: Chen, Zhibo, et al.
Published: (2025)

The Benefits of Diligence
by: Arrial, Victor, et al.
Published: (2024)

Cut-free Deductive System for Continuous Intuitionistic Logic
by: Geoffroy, Guillaume
Published: (2025)

Meaningfulness and Genericity in a Subsuming Framework
by: Kesner, Delia, et al.
Published: (2024)

Algebraic Proof Theory for Infinitary Action Logic
by: Fussner, Wesley, et al.
Published: (2025)

Goedel Logics: On the Elimination of The Absoluteness Operator
by: Baaz, Matthias, et al.
Published: (2026)

Modules and Infinitary Logics
by: Shelah, Saharon
Published: (2010)

Cut elimination for Cyclic Proofs: A Case Study in Temporal Logic
by: Afshari, Bahareh, et al.
Published: (2024)

A Semantic Proof of Generalised Cut Elimination for Deep Inference
by: Atkey, Robert, et al.
Published: (2024)

A Cut-free Sequent Calculus for Basic Intuitionistic Dynamic Topological Logic
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2025)

Proof Complexity of Linear Logics
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2026)

A Linear Temporal Logic of Frequencies on Series of Events
by: Antonelli, Melissa, et al.
Published: (2026)

Variable Elimination as Rewriting in a Linear Lambda Calculus
by: Ehrhard, Thomas, et al.
Published: (2025)

Integer Linear-Exponential Programming in NP by Quantifier Elimination
by: Chistikov, Dmitry, et al.
Published: (2024)

Proof-theoretic Semantics for Intuitionistic Multiplicative Linear Logic (Extended Abstract)
by: Gheorghiu, Alexander V., et al.
Published: (2023)

Uniform Cut-free Bisequent Calculi for Three-valued Logics
by: Indrzejczak, Andrzej, et al.
Published: (2024)