Constructing Fully Complete Models of Multiplicative Linear Logic

DOI10.2168/LMCS-11(3:6)2015MaRDI QIDQ3196336zbMATH OpenFDO

Authors Andrea Schalk, Hugh Paul Steele

Publication date 29 October 2015

Published in Logical Methods in Computer Science (Search for Journal in Brave)

zbMATH Keywords

linear logiccompact closed categoriestensor calculusfull completeness\(\ast\)-autonomous categories

Mathematics Subject Classification ID

Proof-theoretic aspects of linear logic and other substructural logics (03F52) Categorical logic, topoi (03G30) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15)

Recommendations

• Constructing fully complete models for multiplicative linear logic
• scientific article; zbMATH DE number 1303730
• scientific article; zbMATH DE number 17706
• \(\mathbb{Z}\)-modules and full completeness of multiplicative linear logic
• Multiplicative linear logics and fibrations
• Games and full completeness for multiplicative linear logic
• Proofs, denotational semantics and observational equivalences in Multiplicative Linear Logic
• Full intuitionistic linear logic
• Pontrjagin duality and full completeness for multiplicative linear logic (without Mix)
• Modular construction of complete coalgebraic logics

Cited in

(5)

• Glueing and orthogonality for models of linear logic
• Multiplexor Categories and Models of Soft Linear Logic
• Constructing fully complete models for multiplicative linear logic
• scientific article; zbMATH DE number 1722655 (Why is no real title available?)
• A monoidal analogue of the 2-category anti-equivalence between \(\mathbb{ABEX}\) and \(\mathbb{DEF} \)

This page was built for publication: Constructing Fully Complete Models of Multiplicative Linear Logic

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