Tortora de Falco L., Generalized Standardization lemma for the additives, vol. 3 Electronic Notes in Theoretical Computer Science, 1996 This article was processed using the L a T E X macro package with LLNCS style  Home/Search   Document Not in Database   Summary   Related Articles

....defined by Girard in [Girard 91] when we meet a difficult rule, then, instead of choosing one of the two possible linear translations, we superimpose them. Technically speaking, the obvious candidate to superimpose proofs is the linear connective . Following one of the main points of [Tortora 96] namely the independence lemma ) to make sure that the components of the additive boxes introduced by P a do not interact during cut elimination, we keep these additive boxes at exponential depth zero. This is done by choosing as main doors for these additive boxes a purely negative ....

....pol by decomposing the multiplicative conjunction between two negative formulas into an additive one and a multiplicative conjunction with V (the classical unit for the multiplicative conjunction) 2. 2 About the additives In this subsection, we briefly recall the independence lemma, proven in [Tortora 96] Although we will not use this result (so that this subsection is not, strictly speaking, necessary to understand the content of the paper) it has been one of the main sources of inspiration for the present work. We assume here that the reader has some acquaintance with the proof nets of LL ....

Tortora de Falco L., Generalized Standardization lemma for the additives, vol. 3 Electronic Notes in Theoretical Computer Science, 1996 This article was processed using the L a T E X macro package with LLNCS style

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC