Technical Reports (CIS)

Document Type

Technical Report

Date of this Version

July 1993

Comments

University of Pennsylvania Department of Computer and Information Science Technical Report No. MS-CIS-93-67.

Abstract

We prove the decidability of the Tensor-Bang fragment of linear logic and establish upper (doubly exponential) and lower (NP-hard) bounds.

Share

COinS
 

Date Posted: 17 August 2007