z-logo
open-access-imgOpen Access
Provability in TBLL: A decision procedure
Author(s) -
Jawahar Chirimar,
James Lipton
Publication year - 2005
Publication title -
computer science logic
Language(s) - English
Resource type - Book series
ISBN - 3-540-55789-X
DOI - 10.1007/bfb0023757
Subject(s) - decidability , fragment (logic) , mathematics , exponential function , calculus (dental) , pure mathematics , discrete mathematics , algorithm , mathematical analysis , medicine , dentistry
We prove the decidability of the Tensor-Bang fragment of linear logic and establish an upper (doubly exponential) bound.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom