Date of this Version
We prove the decidability of the Tensor-Bang fragment of linear logic and establish upper (doubly exponential) and lower (NP-hard) bounds.
Jawahar Chirimar and James Lipton, "Provability in TBLL: A Decision Procedure", . July 1993.
Date Posted: 17 August 2007