DeepAI AI Chat
Log In Sign Up

TOWER-Complete Problems in Contraction-Free Substructural Logics

by   Hiromi Tanaka, et al.

We investigate the computational complexity of a family of substructural logics with exchange and weakening but without contraction. With the aid of the techniques provided by LaziΔ‡ and Schmitz (2015), we show that the deducibility problem for full Lambek calculus with exchange and weakening (𝐅𝐋_𝐞𝐰) is TOWER-complete, where TOWER is one of the non-elementary complexity classes introduced by Schmitz (2016). The same complexity result holds even for deducibility in BCK-logic, i.e., the implicational fragment of 𝐅𝐋_𝐞𝐰. We furthermore show the TOWER-completeness of the provability problem for elementary affine logic, which was proved to be decidable by Dal Lago and Martini (2004).


page 1

page 2

page 3

page 4

βˆ™ 04/20/2021

Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics

We establish decidability for the infinitely many axiomatic extensions o...
βˆ™ 09/30/2019

A note on undecidability of propositional non-associative linear logics

We introduce a non-associative and non-commutative version of propositio...
βˆ™ 08/14/2019

On the Elementary Affine Lambda-Calculus with and Without Fixed Points

The elementary affine lambda-calculus was introduced as a polyvalent set...
βˆ™ 05/30/2019

Rules with parameters in modal logic II

We analyze the computational complexity of admissibility and unifiabilit...
βˆ™ 04/15/2019

On the Lambek Calculus with an Exchange Modality

In this paper we introduce Commutative/Non-Commutative Logic (CNC logic)...
βˆ™ 02/19/2019

Elementary-base cirquent calculus II: Choice quantifiers

Cirquent calculus is a novel proof theory permitting component-sharing b...
βˆ™ 11/09/2018

Unique End of Potential Line

This paper studies the complexity of problems in PPAD ∩ PLS that have un...