Polynomial equivalence among systems LLNC, LLNC\(_a\) and LLNC\(_0\)

DOI10.1016/S0304-3975(99)00053-5zbMath0951.03057MaRDI QIDQ1575872

François Métayer

Publication date: 23 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

decision problemsfragments of cyclic linear logicnon-commutative proofnets

Mathematics Subject Classification ID

Proof-theoretic aspects of linear logic and other substructural logics (03F52) Complexity of proofs (03F20)

Related Items (2)

Lambek calculus is NP-complete ⋮ Lambek calculus with one division and one primitive type permitting empty antecedents

This page was built for publication: Polynomial equivalence among systems LLNC, LLNC\(_a\) and LLNC\(_0\)