On the Lambek Calculus with an Exchange Modality

04/15/2019
by   Jiaming Jiang, et al.
0

In this paper we introduce Commutative/Non-Commutative Logic (CNC logic) and two categorical models for CNC logic. This work abstracts Benton's Linear/Non-Linear Logic by removing the existence of the exchange structural rule. One should view this logic as composed of two logics; one sitting to the left of the other. On the left, there is intuitionistic linear logic, and on the right is a mixed commutative/non-commutative formalization of the Lambek calculus. Then both of these logics are connected via a pair of monoidal adjoint functors. An exchange modality is then derivable within the logic using the adjunction between both sides. Thus, the adjoint functors allow one to pull the exchange structural rule from the left side to the right side. We then give a categorical model in terms of a monoidal adjunction, and then a concrete model in terms of dialectica Lambek spaces.

READ FULL TEXT
research
03/03/2020

Decision Problems for Propositional Non-associative Linear Logic and Extensions

In our previous work, we proposed the logic obtained from full non-assoc...
research
12/02/2019

A categorical reduction system for linear logic

We build calculus on the categorical model of linear logic. It enables u...
research
01/06/2022

Non-associative and projective linear logics

A non-commutative, non-associative weakening of Girard's linear logic is...
research
01/07/2022

TOWER-Complete Problems in Contraction-Free Substructural Logics

We investigate the computational complexity of a family of substructural...
research
10/23/2017

Fitch-Style Modal Lambda Calculi

Fitch-style modal deduction, in which modalities are eliminated by openi...
research
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...
research
04/20/2021

Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics

We establish decidability for the infinitely many axiomatic extensions o...

Please sign up or login with your details

Forgot password? Click here to reset