Optimization complexity of linear logic proof games

From MaRDI portal

Publication:1575867

Jump to:navigation, search

DOI10.1016/S0304-3975(99)00057-2zbMath0951.03056MaRDI QIDQ1575867

Patrick D. Lincoln, John C. Mitchell, Andrej Scedrov

Publication date: 23 August 2000

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

zbMATH Keywords

complexity propositional linear logic multiplicative fragment linear logic proof games multiplicative additive fragment

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (1)

This page was built for publication: Optimization complexity of linear logic proof games

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1575867&oldid=13860470"