Add to ORKGWe revisit the correctness criterion for the multiplicative additive fragment of linear logic. We prove that deciding the correctness of corresponding proof structures is NL-complete
We present a new correctness criterion for Multiplicative Linear Logic (MLL) proof nets. Our criteri...
A cornerstone of the theory of proof nets for unit-free multiplicative linear logic (MLL) is the abs...
A cornerstone of the theory of proof nets for unit-free multiplicative linear logic (MLL) is the abs...
AbstractWe provide new correctness criteria for all fragments (multiplicative, exponential, additive...
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...
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 ...
Given a logic presented in a sequent calculus, a natural question is that ofequivalence of proofs: t...
15 pagesInternational audienceWe provide a new correctness criterion for unit-free MLL proof structu...
Abstract proof structures in multiplicative linear logic are graphs with some extra structure, and t...
submitted (March 2006)We study conditions for a concurrent construction of proof-nets in the framewo...
Proof nets are a parallel syntax for sequential proofs of linear logic, firstly introduced by Girard...
AbstractIn this paper the questions remaining open about NP-completeness of multiplicative and Horn ...
We present a new correctness criterion for Multiplicative Linear Logic (MLL) proof nets. Our criteri...
A cornerstone of the theory of proof nets for unit-free multiplicative linear logic (MLL) is the abs...
A cornerstone of the theory of proof nets for unit-free multiplicative linear logic (MLL) is the abs...
AbstractWe provide new correctness criteria for all fragments (multiplicative, exponential, additive...
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...
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 ...
Given a logic presented in a sequent calculus, a natural question is that ofequivalence of proofs: t...
15 pagesInternational audienceWe provide a new correctness criterion for unit-free MLL proof structu...
Abstract proof structures in multiplicative linear logic are graphs with some extra structure, and t...
submitted (March 2006)We study conditions for a concurrent construction of proof-nets in the framewo...
Proof nets are a parallel syntax for sequential proofs of linear logic, firstly introduced by Girard...
AbstractIn this paper the questions remaining open about NP-completeness of multiplicative and Horn ...
We present a new correctness criterion for Multiplicative Linear Logic (MLL) proof nets. Our criteri...
A cornerstone of the theory of proof nets for unit-free multiplicative linear logic (MLL) is the abs...
A cornerstone of the theory of proof nets for unit-free multiplicative linear logic (MLL) is the abs...