Sequent systems for compact bilinear logic

DOI10.1002/MALQ.200310050zbMath1036.03046OpenAlexW2100232191MaRDI QIDQ4434501

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

sequent calculuscut-eliminationcompact bilinear logic

Mathematics Subject Classification ID

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

Related Items (8)

Type logics and pregroups ⋮ Learnability of pregroup grammars ⋮ On the logic of \(\beta\)-pregroups ⋮ Should pregroup grammars be adorned with additional operations? ⋮ Pregroup grammars with letter promotions: complexity and context-freeness ⋮ A modular and parameterized presentation of pregroup calculus ⋮ Periodic lattice-ordered pregroups are distributive ⋮ Extensions of Lambek Calculi

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