AbstractWe provide new correctness criteria for all fragments (multiplicative, exponential, additive) of linear logic. We use these criteria for proving that deciding the correctness of a linear logic proof structure is NL-complete
AbstractThe paper presents in full detail the first linear algorithm given in the literature (Guerri...
Since its inception in 1987 linear logic (LL, [3]) has changed the proof theoreti-cal way of dealing...
We present a new correctness criterion for Multiplicative Linear Logic (MLL) proof nets. Our criteri...
We revisit the correctness criterion for the multiplicative additive fragment of linear logic. We pr...
AbstractWe provide new correctness criteria for all fragments (multiplicative, exponential, additive...
23 pagesInternational audienceWe provide new correctness criteria for all fragments (multiplicative,...
Abstract. We provide a new correctness criterion for unit-free MLL proof structures and MELL proof s...
15 pagesInternational audienceWe provide a new correctness criterion for unit-free MLL proof structu...
AbstractIn this paper the questions remaining open about NP-completeness of multiplicative and Horn ...
Abstract—In Girard’s original presentation, proof structures of Linear Logic are hypergraphs whose h...
submitted (March 2006)We study conditions for a concurrent construction of proof-nets in the framewo...
Proof-nets are special graphs (proof-structures) representing desequentialised proofs of the linear ...
Proof-nets are special graphs (proof-structures) representing desequentialised proofs of the linear ...
Proof nets are a parallel syntax for sequential proofs of linear logic, firstly introduced by Girard...
Abstract proof structures in multiplicative linear logic are graphs with some extra structure, and t...
AbstractThe paper presents in full detail the first linear algorithm given in the literature (Guerri...
Since its inception in 1987 linear logic (LL, [3]) has changed the proof theoreti-cal way of dealing...
We present a new correctness criterion for Multiplicative Linear Logic (MLL) proof nets. Our criteri...
We revisit the correctness criterion for the multiplicative additive fragment of linear logic. We pr...
AbstractWe provide new correctness criteria for all fragments (multiplicative, exponential, additive...
23 pagesInternational audienceWe provide new correctness criteria for all fragments (multiplicative,...
Abstract. We provide a new correctness criterion for unit-free MLL proof structures and MELL proof s...
15 pagesInternational audienceWe provide a new correctness criterion for unit-free MLL proof structu...
AbstractIn this paper the questions remaining open about NP-completeness of multiplicative and Horn ...
Abstract—In Girard’s original presentation, proof structures of Linear Logic are hypergraphs whose h...
submitted (March 2006)We study conditions for a concurrent construction of proof-nets in the framewo...
Proof-nets are special graphs (proof-structures) representing desequentialised proofs of the linear ...
Proof-nets are special graphs (proof-structures) representing desequentialised proofs of the linear ...
Proof nets are a parallel syntax for sequential proofs of linear logic, firstly introduced by Girard...
Abstract proof structures in multiplicative linear logic are graphs with some extra structure, and t...
AbstractThe paper presents in full detail the first linear algorithm given in the literature (Guerri...
Since its inception in 1987 linear logic (LL, [3]) has changed the proof theoreti-cal way of dealing...
We present a new correctness criterion for Multiplicative Linear Logic (MLL) proof nets. Our criteri...
DOI
Add to ORKG