Sciweavers

19 search results - page 3 / 4
» Correctness of Multiplicative Proof Nets Is Linear
Sort
View
LICS
2008
IEEE
15 years 3 months ago
Correctness of Multiplicative Additive Proof Structures is NL-Complete
We revisit the correctness criterion for the multiplicative additive fragment of linear logic. We prove that deciding the correctness of corresponding proof structures is NLcomple...
Paulin Jacobé de Naurois, Virgile Mogbil
TCS
2011
14 years 4 months ago
Correctness of linear logic proof structures is NL-complete
We 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...
Paulin Jacobé de Naurois, Virgile Mogbil
CORR
2006
Springer
104views Education» more  CORR 2006»
14 years 9 months ago
From Proof Nets to the Free *-Autonomous Category
Abstract. In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theor...
François Lamarche, Lutz Straßburger
74
Voted
ENTCS
2007
107views more  ENTCS 2007»
14 years 9 months ago
Event Domains, Stable Functions and Proof-Nets
We pursue the program of exposing the intrinsic mathematical structure of the “space of proofs” of a logical system [AJ94b]. We study the case of Multiplicative-Additive Linea...
Samson Abramsky
PPDP
1999
Springer
15 years 1 months ago
A Calculus for Interaction Nets
hemical abstract machine Shinya Sato Himeji Dokkyo University, Faculty of Econoinformatics, 7-2-1 Kamiohno, Himeji-shi, Hyogo 670-8524, Japan Ian Mackie LIX, CNRS UMR 7161, ´Ecole...
Maribel Fernández, Ian Mackie