Data di Pubblicazione:
1999
Abstract:
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.
Tipologia CRIS:
04A-Conference paper in volume
Elenco autori:
L. ROVERSI
Link alla scheda completa:
Titolo del libro:
Computer Science Logic, 13th International Workshop, {CSL} '99, 8th Annual Conference of the EACSL, Madrid, Spain, September 20-25, 1999, Proceedings
Pubblicato in: