Chirimar, JawaharLipton, James2023-05-222023-05-221993-07-012007-08-17https://repository.upenn.edu/handle/20.500.14332/7430We prove the decidability of the Tensor-Bang fragment of linear logic and establish upper (doubly exponential) and lower (NP-hard) bounds.Provability in TBLL: A Decision ProcedureReport