Undecidability of the Lambek calculus with subexponential and bracket modalities
From MaRDI portal
Publication:1679987
DOI10.1007/978-3-662-55751-8_26zbMath1495.03036arXiv1608.04020OpenAlexW2962744611MaRDI QIDQ1679987
Stepan Kuznetsov, Max I. Kanovich, Andrej Scedrov
Publication date: 22 November 2017
Full work available at URL: https://arxiv.org/abs/1608.04020
Logic of natural languages (03B65) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)
Related Items (4)
Parsing/theorem-proving for logical grammar \textit{CatLog3} ⋮ Bracket induction for Lambek calculus with bracket modalities ⋮ The multiplicative-additive Lambek calculus with subexponential and bracket modalities ⋮ Subexponentials in non-commutative linear logic
This page was built for publication: Undecidability of the Lambek calculus with subexponential and bracket modalities
