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...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science s. 1 - 13
Hlavní autori:	Balasubramanian, A. R., Lang, Timo, Ramanayake, Revantha
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 29.06.2021
Predmet:	Calculus Computational complexity Computer science Fuzzy logic Upper bound
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!