On embedding Lambek calculus into commutative categorial grammars

05/20/2020
by   Sergey Slavnov, et al.
0

Abstract categorial grammars (ACG), as well as some other, closely related systems, are based on the ordinary, commutative implicational linear logic and linear λ-calculus in contrast to the better known "noncommutative" Lambek grammars and their variations. ACG seem attractive in many ways, not the least of which is the simplicity of the underlying logic. Yet it is known that ACG and their relatives behave poorly in modeling many natural language phenomena (such as, for example, coordination) compared to "noncommutative" formalisms. Therefore different solutions have been proposed in order to enrich ACG with noncommutative constructions. Tensor grammars of this work are another example of "commutative" grammars, based on the classical, rather than intuitionistic linear logic. They can be seen as a surface representation of ACG in the sense that derivations of ACG translate to derivations of tensor grammars and this translation is isomorphic on the level of string languages. An advantage of this representation, as it seems to us, is that the syntax becomes extremely simple and a direct geometric meaning is transparent. We address the problem of encoding noncommutative operations in our setting. This turns out possible after enriching the system with new unary operators. The resulting system allows representing both ACG and Lambek grammars as conservative fragments, while the formalism remains, as it seems to us, rather simple and intuitive.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/17/2022

Making first order linear logic a generating grammar

It is known that different categorial grammars have surface representati...
research
12/31/2021

First order linear logic and tensor type calculus for categorial grammars

We study relationship between first order multiplicative linear logic (M...
research
04/25/2018

Enriching a Linear/Non-linear Lambda Calculus: A Programming Language for String Diagrams

Linear/non-linear (LNL) models, as described by Benton, soundly model a ...
research
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...
research
07/16/2019

Abstract categorial grammars with island constraints and effective decidability

A well-known approach to treating syntactic island constraints in the se...
research
09/26/2020

Neural Proof Nets

Linear logic and the linear λ-calculus have a long standing tradition in...
research
04/15/2019

From Linear Logic to Cyclic Sharing

We present a translation from Multiplicative Exponential Linear Logic to...

Please sign up or login with your details

Forgot password? Click here to reset