On NP-completeness in linear logic

DOI10.1016/0168-0072(94)00061-7MaRDI QIDQ1899149zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 4101150 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Linear logic

Cited in

(4)

• Correctness of linear logic proof structures is NL-complete
• scientific article; zbMATH DE number 1978362 (Why is no real title available?)
• scientific article; zbMATH DE number 1765669 (Why is no real title available?)
• On Hardness of Multilinearization and VNP-Completeness in Characteristic 2

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1899149)