A P-Time Completeness Proof for Light Logics

Authors:
Luca Roversi
Affiliations:
-
Venue:
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Year:
1999

Citing 3
Cited 3

Proofs and types

Proofs and types
Light linear logic

Information and Computation
Light Affine Logic

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science

Discreet Games, Light Affine Logic and PTIME Computation

Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Actual Arithmetic and Feasibility

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Light Linear Logic with Controlled Weakening

LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We explain why the original proofs of P-Time completeness forLigh t Affine Logic and Light LinearLogic can not work, and we fully develop a working one.