Skip to main content
Conference Proceedings

Provability in TBLL: A decision procedure

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1992) 626 LNCS 53-67
DOI: 10.1007/bfb0023757
3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We prove the decidability of the Tensor-Bang fragment of linear logic and establish an upper (doubly exponential) bound.

Cite

CITATION STYLE

APA

Chirimar, J., & Lipton, J. (1992). Provability in TBLL: A decision procedure. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 626 LNCS, pp. 53–67). Springer Verlag. https://doi.org/10.1007/bfb0023757

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free