A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
Connection-based proof construction in linear logic
[chapter]
1997
Lecture Notes in Computer Science
Preserved Fulltext
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
doi:10.1007/3-540-63104-6_20
fatcat:ecyktsdfyndlvg4h6accwc544u