A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/1608.04020v2.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Undecidability of the Lambek calculus with subexponential and bracket modalities
[article]
<span title="2017-05-04">2017</span>
<i >
arXiv
</i>
<span class="release-stage" >pre-print</span>
Preserved Fulltext
Other Versions
<span title="2016-08-13">2016</span>
<span class="release-stage" >pre-print</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1608.04020v1">arXiv:1608.04020v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/njghjpch6fh7hmwbytbnd7nfvu">fatcat:njghjpch6fh7hmwbytbnd7nfvu</a> </span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1608.04020v1">arXiv:1608.04020v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/njghjpch6fh7hmwbytbnd7nfvu">fatcat:njghjpch6fh7hmwbytbnd7nfvu</a> </span>
The Lambek calculus is a well-known logical formalism for modelling natural language syntax. The original calculus covered a substantial number of intricate natural language phenomena, but only those restricted to the context-free setting. In order to address more subtle linguistic issues, the Lambek calculus has been extended in various ways. In particular, Morrill and Valentin (2015) introduce an extension with so-called exponential and bracket modalities. Their extension is based on a
<span class="external-identifiers">
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1608.04020v2">arXiv:1608.04020v2</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/q2awwnol7jetzom5mzih23u2ou">fatcat:q2awwnol7jetzom5mzih23u2ou</a>
</span>
more »
... ndard contraction rule for the exponential that interacts with the bracket structure in an intricate way. The standard contraction rule is not admissible in this calculus. In this paper we prove undecidability of the derivability problem in their calculus. We also investigate restricted decidable fragments considered by Morrill and Valentin and we show that these fragments belong to the NP class.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200824012125/https://arxiv.org/pdf/1608.04020v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/98/8c/988c83336a111e90e82f3de42773cb2d82bb6aea.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1608.04020v2" title="arxiv.org access">
<button class="ui compact blue labeled icon button serp-button">
<i class="file alternate outline icon"></i>
arxiv.org
</button>
</a>