DeepAI AI Chat
Log In Sign Up

Undecidability of the Lambek calculus with a relevant modality

01/23/2016
by   Max Kanovich, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

08/13/2016

Undecidability of the Lambek calculus with subexponential and bracket modalities

The Lambek calculus is a well-known logical formalism for modelling natu...
01/26/2021

Categorical Vector Space Semantics for Lambek Calculus with a Relevant Modality (Extended Abstract)

We develop a categorical compositional distributional semantics for Lamb...
12/31/2017

A Light Modality for Recursion

We investigate the interplay between a modality for controlling the beha...
11/22/2021

Vector Space Semantics for Lambek Calculus with Soft Subexponentials

We develop a vector space semantics for Lambek Calculus with Soft Subexp...
04/06/2023

Unifying Linearity and Dependency Analyses

Linearity and dependency analyses are key to several applications in com...
05/06/2020

Categorical Vector Space Semantics for Lambek Calculus with a Relevant Modality

We develop a categorical compositional distributional semantics for Lamb...
07/09/2023

A Complete Finite Equational Axiomatisation of the Fracterm Calculus for Common Meadows

We analyse abstract data types that model numerical structures with a co...