1 citations · 1 across the 3 of their papers we have counts for
Showing math.LOShow all
2 papers · 1 filter
math.LO2022
Tower-Complete Problems in Contraction-Free Substructural Logics
Hiromi Tanaka
We investigate the non-elementary computational complexity of a family of substructural logics without contraction. With the aid of the technique pioneered by Lazić and Schmitz (20…
math.LO2020
Decision Problems for Propositional Non-associative Linear Logic and Extensions
Hiromi Tanaka
In our previous work, we proposed the logic obtained from full non-associative Lambek calculus by adding a sort of linear-logical modality. We call this logic non-associative non-c…