Undecidability of the Lambek calculus with a relevant modality

January 23, 2016 ยท The Ethereal ยท ๐Ÿ› IEEE International Conference on Automatic Face & Gesture Recognition

๐Ÿ”ฎ THE ETHEREAL: The Ethereal
Pure theory โ€” exists on a plane beyond code

"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 shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Logic