Saturated formulas in full linear logic
Maurizio Castellan · Journal of Logic and Computation · 1998
In this note, we show by a proof-theoretical argument that in full linear logic the set of formulas for which contraction and weakening are admissible (the set of saturated formulas) does not coincide (up to equivalences) with the set of exponentiated formulas. This solves an open problem of Schellinx.