CINECA IRIS Institutional Research Information System

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.

A P-Time Completeness Proof for Light Logics

ROVERSI, Luca
1999-01-01

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.
1999
8th Annual Conference of the EACSL (CSL'99)
Madrid (Spain)
September 20-25, 1999
Computer Science Logic, 13th International Workshop, {CSL} '99, 8th Annual Conference of the EACSL, Madrid, Spain, September 20-25, 1999, Proceedings
Springer
1683/1999
469
483
3-540-66536-6
http://www.di.unito.it/~rover/RESEARCH/PUBLICATIONS/1999-CSL/Roversi1999CSL.pdf
L. ROVERSI
04A-Conference paper in volume
File in questo prodotto:
File Dimensione Formato  
Roversi1999CSL.pdf

Accesso riservato

Tipo di file: POSTPRINT (VERSIONE FINALE DELL’AUTORE)
Dimensione 191.55 kB
Formato Adobe PDF
  Visualizza/Apri   Richiedi una copia
191.55 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2318/23067
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 22
  • ???jsp.display-item.citation.isi??? 16
social impact