On \(\text{NP}\)-completeness in linear logic

DOI10.1016/0168-0072(94)00061-7zbMath0836.03008OpenAlexW2006858326MaRDI QIDQ1899149

Alexey P. Kopylov

Publication date: 2 May 1996

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(94)00061-7

zbMATH Keywords

NP-completenesslinear logicmultiplicative fragmentweakening ruleHorn fragment

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Subsystems of classical logic (including intuitionistic logic) (03B20)

Cites Work

• Linear logic
• Unnamed Item
• Unnamed Item

This page was built for publication: On \(\text{NP}\)-completeness in linear logic