We formulate Girard's long trip criterion for multiplicative linear logic (MLL) in a topological way, by associating a ribbon diagram to every switching, and requiring that it is homeomorphic to the disk. Then, we extend the well-known planarity criterion for multiplicative cyclic linear logic (McyLL) to multiplicative non-commutative logic (MNL) and show that the resulting planarity criterion is equivalent to Abrusci and Ruet's original long trip criterion for MNL
Linear logic (LL) is very expressive: the smallest propositonal fragment is already NP-complete and ...
International audienceThe exponential modality of linear logic associates a commutative comonoid !A ...
Proof equivalence in a logic is the problem of deciding whether two proofs are equivalent modulo a s...
AbstractIt is well known that every proof net of a non-commutative version of MLL (multiplicative fr...
AbstractIt is well-known that every proof net of a non-commutative version of MLL (Multiplicative fr...
AbstractWe provide new correctness criteria for all fragments (multiplicative, exponential, additive...
23 pagesInternational audienceWe provide new correctness criteria for all fragments (multiplicative,...
We present a new correctness criterion for Multiplicative Linear Logic (MLL) proof nets. Our criteri...
15 pagesInternational audienceWe provide a new correctness criterion for unit-free MLL proof structu...
AbstractWe study conditions for a concurrent construction of proof-nets in the framework of linear l...
12 pages in two columns. Uses Paul Taylor's diagrams.As an attempt to uncover the topological nature...
AbstractWe give a new proof of the NP-completeness of multiplicative linear logic without constants ...
In this thesis we investigate certain structural refinements of multiplicative linear logic, obtaine...
We introduce a new correctness criterion for multiplicative non commutative proof nets which can be ...
AbstractWe consider intuitionistic fragments of multiplicative linear logic for which we define appr...
Linear logic (LL) is very expressive: the smallest propositonal fragment is already NP-complete and ...
International audienceThe exponential modality of linear logic associates a commutative comonoid !A ...
Proof equivalence in a logic is the problem of deciding whether two proofs are equivalent modulo a s...
AbstractIt is well known that every proof net of a non-commutative version of MLL (multiplicative fr...
AbstractIt is well-known that every proof net of a non-commutative version of MLL (Multiplicative fr...
AbstractWe provide new correctness criteria for all fragments (multiplicative, exponential, additive...
23 pagesInternational audienceWe provide new correctness criteria for all fragments (multiplicative,...
We present a new correctness criterion for Multiplicative Linear Logic (MLL) proof nets. Our criteri...
15 pagesInternational audienceWe provide a new correctness criterion for unit-free MLL proof structu...
AbstractWe study conditions for a concurrent construction of proof-nets in the framework of linear l...
12 pages in two columns. Uses Paul Taylor's diagrams.As an attempt to uncover the topological nature...
AbstractWe give a new proof of the NP-completeness of multiplicative linear logic without constants ...
In this thesis we investigate certain structural refinements of multiplicative linear logic, obtaine...
We introduce a new correctness criterion for multiplicative non commutative proof nets which can be ...
AbstractWe consider intuitionistic fragments of multiplicative linear logic for which we define appr...
Linear logic (LL) is very expressive: the smallest propositonal fragment is already NP-complete and ...
International audienceThe exponential modality of linear logic associates a commutative comonoid !A ...
Proof equivalence in a logic is the problem of deciding whether two proofs are equivalent modulo a s...