A formulation of linear logic based on dependency-relations

DOI10.1007/BFB0028011MaRDI QIDQ4218928zbMATH OpenFDO

Authors Torben Braüner, Valeria de Paiva

Publication date 19 April 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0028011

zbMATH Keywords

classical linear logiccut-eliminationexponential-free and multiplicative linear logicFILLfull intuitionistic linear logic

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Cut-elimination and normal-form theorems (03F05)

Recommendations

• A note on full intuitionistic linear logic
• Multiple conclusion linear logic: cut elimination and more
• A Parigot-style linear -calculus for full intuitionistic linear logic
• Multiple conclusion linear logic: cut elimination and more

Cited in

(5)

• A note on full intuitionistic linear logic
• The multiplicative-additive Lambek calculus with subexponential and bracket modalities
• Multiple conclusion linear logic: cut elimination and more
• Subexponentials in non-commutative linear logic
• Multiple conclusion linear logic: cut elimination and more

This page was built for publication: A formulation of linear logic based on dependency-relations

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