DeepAI AI Chat

Bouncing threads for infinitary and circular proofs

05/17/2020

∙

by David Baelde, et al.

∙

∙

We generalize the validity criterion for the infinitary proof system of the multiplicative additive linear logic with fixed points. Our criterion is designed to take into account axioms and cuts. We show that it is sound and enjoys the cut elimination property. We finally study its decidability properties, and prove that it is undecidable in general but becomes decidable under some restrictions.

David Baelde
2 publications
Amina Doumane
1 publication
Denis Kuperberg
3 publications
Alexis Saurin
2 publications

page 1

page 2

page 3

page 4

∙ 07/22/2022

Elimination and cut-elimination in multiplicative linear logic

We associate to every proof structure in multiplicative linear logic an ...

0 Daniel Murfet, et al. ∙

∙ 01/15/2020

Circular Proofs in First-Order Linear Logic with Least and Greatest Fixed Points

Inductive and coinductive structures are everywhere in mathematics and c...

0 Farzaneh Derakhshan, et al. ∙

∙ 08/15/2023

Infinitary cut-elimination via finite approximations

We investigate non-wellfounded proof systems based on parsimonious logic...

0 Matteo Acclavio, et al. ∙

∙ 04/28/2021

Linear Additives

We introduce 𝖫𝖠𝖬, a subsystem of 𝖨𝖬𝖠𝖫𝖫_2 with restricted additive rules ...

0 Gianluca Curzi, et al. ∙

∙ 07/31/2020

The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities

We give a proof-theoretic and algorithmic complexity analysis for system...

0 Max Kanovich, et al. ∙

∙ 07/31/2020

Stellar Resolution: Multiplicatives

We present a new asynchronous model of computation named Stellar Resolut...

0 Boris Eng, et al. ∙

∙ 02/14/2019

An application of parallel cut elimination in multiplicative linear logic to the Taylor expansion of proof nets

We examine some combinatorial properties of parallel cut elimination in ...

0 Jules Chouquet, et al. ∙