From the publisher's description: "This book is the refereed proceedings of the First International Meeting on Linear Logic held at Cornell University in June 1993. Survey papers devoted to specific areas of linear logic, as well as an extensive general introduction to the subject by J.-Y. Girard, have been added, so as to make this book a valuable tool both for the beginner and for the advanced researcher." Author's remark: The paper gives a characterization of subnets of proof-nets (empires and kingdoms) that allows us to simplify known results concerning proof-nets for first-order multiplicative linear logic without units. Later these results were applied verbatim in the theory of proof-nets for classical logic. Cited by: Edmund Robinson. Proof Nets for Classical Logic. Journal of Logic and Computation, 2003, Vol 13 (5) pp. 777 - 797
Subnets of Proof-nets in MLL-
BELLIN, Gianluigi;
1995-01-01
Abstract
From the publisher's description: "This book is the refereed proceedings of the First International Meeting on Linear Logic held at Cornell University in June 1993. Survey papers devoted to specific areas of linear logic, as well as an extensive general introduction to the subject by J.-Y. Girard, have been added, so as to make this book a valuable tool both for the beginner and for the advanced researcher." Author's remark: The paper gives a characterization of subnets of proof-nets (empires and kingdoms) that allows us to simplify known results concerning proof-nets for first-order multiplicative linear logic without units. Later these results were applied verbatim in the theory of proof-nets for classical logic. Cited by: Edmund Robinson. Proof Nets for Classical Logic. Journal of Logic and Computation, 2003, Vol 13 (5) pp. 777 - 797File | Dimensione | Formato | |
---|---|---|---|
BellinDeWieleLMSLN1995.pdf
accesso aperto
Tipologia:
Documento in Post-print
Licenza:
Dominio pubblico
Dimensione
1.68 MB
Formato
Adobe PDF
|
1.68 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.