Sequent systems for compact bilinear logic

DOI10.1002/MALQ.200310050MaRDI QIDQ4434501zbMATH OpenOpenAlexFDO

Authors Wojciech Buszkowski

Publication date 10 November 2003

Published in MLQ (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.200310050

zbMATH Keywords

compact bilinear logiccut-eliminationsequent calculus

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Recommendations

• A Sequent Calculus for Bilattice-Based Logic and Its Many-Sorted Representation
• scientific article; zbMATH DE number 218517
• scientific article; zbMATH DE number 1950250
• Sequent-systems for modal logic
• Logic programming with sequent systems: a linear logic approach
• Sequent Calculi for Intuitionistic Linear Logic with Strong Negation
• scientific article; zbMATH DE number 589741
• Sequent calculus for hybrid logic
• scientific article; zbMATH DE number 5070356
• scientific article; zbMATH DE number 2152687

Cited in

(11)

• Pregroup grammars with letter promotions: complexity and context-freeness
• Periodic lattice-ordered pregroups are distributive
• Type logics and pregroups
• Learnability of pregroup grammars
• On the logic of -pregroups
• Should pregroup grammars be adorned with additional operations?
• Sequent Systems for Lewis’ Conditional Logics
• One-Sided Sequent Systems for Nonassociative Bilinear Logic: Cut Elimination and Complexity
• Extensions of Lambek calculi
• On strictifying extensional reflexivity in compact closed categories
• A modular and parameterized presentation of pregroup calculus

This page was built for publication: Sequent systems for compact bilinear logic

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