Sciweavers

Share
CSL
1999
Springer

A P-Time Completeness Proof for Light Logics

9 years 11 months ago
A P-Time Completeness Proof for Light Logics
We explain why the original proofs of P-Time completeness for Light Affine Logic and Light Linear Logic can not work, and we fully develop a working one.
Luca Roversi
Added 22 Dec 2010
Updated 22 Dec 2010
Type Journal
Year 1999
Where CSL
Authors Luca Roversi
Comments (0)
books