1521-3870/asset/2256_left.gif?v=1&s=becebab9c3e85769a14b145f17b8e337848bc48b)
1521-3870/asset/2256_right.gif?v=1&s=6d251fa351b8e0943ed3dc42b2beb251d4cbfa3e)
Original Paper
Sequent systems for compact bilinear logic
Article first published online: 3 JUL 2003
DOI: 10.1002/malq.200310050
Copyright © 2003 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim
1521-3870/asset/cover.gif?v=1&s=3df32dbed8d9153ac6eafe1eaa786854b9b48345 "Mathematical Logic Quarterly")
Additional Information
How to Cite
Buszkowski, W. (2003), Sequent systems for compact bilinear logic. Mathematical Logic Quarterly, 49: 467–474. doi: 10.1002/malq.200310050
Publication History
- Issue published online: 3 JUL 2003
- Article first published online: 3 JUL 2003
- Manuscript Accepted: 15 MAR 2003
- Manuscript Revised: 12 MAR 2003
- Manuscript Received: 21 SEP 2002
- Abstract
- References
- Cited By
Keywords:
- Noncommutative linear logic;
- sequent system;
- cut elimination
Abstract
Compact Bilinear Logic (CBL), introduced by Lambek [14], arises from the multiplicative fragment of Noncommutative Linear Logic of Abrusci [1] (also called Bilinear Logic in [13]) by identifying times with par and 0 with 1. In this paper, we present two sequent systems for CBL and prove the cut-elimination theorem for them. We also discuss a connection between cut-elimination for CBL and the Switching Lemma from [14].