scientific article; zbMATH DE number 1231522

MaRDI QIDQ4222837zbMATH OpenFDO

Authors John Mitchell, P. Lincoln, Andre Scedrov

Publication date 13 December 1998

Full work available at URL http://www.elsevier.com/cas/tree/store/tcs/free/noncas/pc/volume3.htm#lincoln

zbMATH Keywords

additive fragmentcomplexitylinear logicmultiplicative fragmentproof gamesproof searchproof tree

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Structure of proofs (03F07) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Optimization complexity of linear logic proof games
• scientific article; zbMATH DE number 785051
• Decision problems for propositional linear logic
• Linear Logic Proof Games and Optimization

Cited in

(11)

• Proof strategies in linear logic
• Optimization complexity of linear logic proof games
• scientific article; zbMATH DE number 1696770 (Why is no real title available?)
• Incremental Algorithms for Local Search from Existential Second-Order Logic
• Local computation in linear logic
• scientific article; zbMATH DE number 1499088 (Why is no real title available?)
• Complexity bounds for sum-product logic via additive proof nets and Petri nets
• scientific article; zbMATH DE number 785051 (Why is no real title available?)
• Compact proof certificates for linear logic
• scientific article; zbMATH DE number 1405458 (Why is no real title available?)
• Linear Logic Proof Games and Optimization

This page was built for publication:

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