Options
Connection-based proof construction in linear logic
Publikationstyp
Conference Paper
Publikationsdatum
1997-07
Sprache
English
Author
First published in
Number in series
1249 LNAI
Start Page
207
End Page
221
Citation
Lecture Notes in Computer Science 1249 LNAI: 207-221 (1997)
Contribution to Conference
Publisher DOI
Scopus ID
Publisher
Springer
We present a matrix characterization of logical validity in the multiplicative fragment of linear logic. On this basis we develop a matrix-based proof search procedure for this fragment and a procedure which translates the machine-found proofs back into the usual sequent calculus for linear logic. Both procedures are straightforward extensions of methods which originally were developed for a uniform treatment of classical, intuitionistic and modal logics. They can be extended to further fragments of linear logic once a matrix characterization has been found.
DDC Class
004: Informatik