Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics

We establish decidability for the infinitely many axiomatic extensions of the commutative Full Lambek logic with weakening FL ew (i.e. IMALLW) that have a cut-free hypersequent proof calculus. Specifically: every analytic structural rule extension of HFL ew . Decidability for the corresponding exten...

Full description

Saved in:

Bibliographic Details
Published in:	Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science pp. 1 - 13
Main Authors:	Balasubramanian, A. R., Lang, Timo, Ramanayake, Revantha
Format:	Conference Proceeding
Language:	English
Published:	IEEE 29.06.2021
Subjects:	Calculus Computational complexity Computer science Fuzzy logic Upper bound
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!