[HTML][HTML] The decidability of the intensional fragment of classical linear logic
K Bimbó - Theoretical Computer Science, 2015 - Elsevier
K Bimbó
Theoretical Computer Science, 2015•ElsevierThe intensional fragment of classical propositional linear logic combines modalities with
contraction-free relevance logic—adding modalized versions of the thinning and contraction
rules. This paper provides a proof of the decidability of this logic based on a sequent
calculus formulation. Some related logics and some other fragments of linear logic are also
shown decidable.
contraction-free relevance logic—adding modalized versions of the thinning and contraction
rules. This paper provides a proof of the decidability of this logic based on a sequent
calculus formulation. Some related logics and some other fragments of linear logic are also
shown decidable.
Abstract
The intensional fragment of classical propositional linear logic combines modalities with contraction-free relevance logic — adding modalized versions of the thinning and contraction rules. This paper provides a proof of the decidability of this logic based on a sequent calculus formulation. Some related logics and some other fragments of linear logic are also shown decidable.
Elsevier
Showing the best result for this search. See all results