A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
Specifying Proof Systems in Linear Logic with Subexponentials
2011
Electronical Notes in Theoretical Computer Science
In the past years, linear logic has been successfully used as a general logical framework for encoding proof systems. Due to linear logic's finer control on structural rules, it is possible to match the structural restrictions specified in the encoded logic with the use of linear logic connectives. However, some systems that impose more complicated structural restrictions on its sequents cannot be easily captured in linear logic, since it only distinguishes two types of formulas: classical and
doi:10.1016/j.entcs.2011.03.009
fatcat:wyzvjdecyvaebolnebwgliih6i