1 citations · 1 across the 3 of their papers we have counts for
1 paper · 1 filter
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…