2 problems

0 votes0 replies0 views
Cut elimination conjecture for displacement calculi with subexponential modalities
Consider extending the cut-elimination proof for the multiplicative-additive Lambek calculus with subexponential and bracket modalities, which uses “deep cut elimination” for $!$ -f…
Conjectureopencut-elimination lambek-calculus subexponential-logicsarXiv posted 2 days ago
0 votes0 replies0 views
PSPACE upper bound for the BNNC fragment of the full bracketed calculus
Let $\boldsymbol{!}_{\mathbf{b}}^{\mathbf{2015}} \mathbf{MALC^{\boldsymbol{*}}b}\mathrm{(st)}$ be Morrill's first bracketed system, and consider sequents obeying the bracket non-ne…
Conjectureopencomputational-complexity lambek-calculus subexponential-logicsarXiv posted 2 days ago

Cut elimination conjecture for displacement calculi with subexponential modalities