๐ฎ
๐ฎ
The Ethereal
Undecidability of the Lambek calculus with a relevant modality
January 23, 2016 ยท The Ethereal ยท ๐ IEEE International Conference on Automatic Face & Gesture Recognition
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Max Kanovich, Stepan Kuznetsov, Andre Scedrov
arXiv ID
1601.06303
Category
math.LO: Logic
Cross-listed
cs.CL
Citations
25
Venue
IEEE International Conference on Automatic Face & Gesture Recognition
Last Checked
1 month ago
Abstract
Morrill and Valentin in the paper "Computational coverage of TLG: Nonlinearity" considered an extension of the Lambek calculus enriched by a so-called "exponential" modality. This modality behaves in the "relevant" style, that is, it allows contraction and permutation, but not weakening. Morrill and Valentin stated an open problem whether this system is decidable. Here we show its undecidability. Our result remains valid if we consider the fragment where all division operations have one direction. We also show that the derivability problem in a restricted case, where the modality can be applied only to variables (primitive types), is decidable and belongs to the NP class.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ Logic
๐ฎ
๐ฎ
The Ethereal
Approximations from Anywhere and General Rough Sets
๐ฎ
๐ฎ
The Ethereal
Undecidability of the Lambek calculus with subexponential and bracket modalities
๐ฎ
๐ฎ
The Ethereal
A family of neighborhood contingency logics
๐ฎ
๐ฎ
The Ethereal
Idempotents in intensional type theory
๐ฎ
๐ฎ
The Ethereal