On the Recognizing Power of the Lambek Calculus with Brackets

09/22/2017
by   Makoto Kanazawa, et al.
0

Every language recognized by the Lambek calculus with brackets is context-free. This is shown by combining an observation by Jäger with an entirely straightforward adaptation of the method Pentus used for the original Lambek calculus. The case of the variant of the calculus allowing sequents with empty antecedents is slightly more complicated, requiring a restricted use of the multiplicative unit.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/17/2017

Eliminating the unit constant in the Lambek calculus with brackets

We present a translation of the Lambek calculus with brackets and the un...
research
01/16/2018

Refining Properties of Filter Models: Sensibility, Approximability and Reducibility

In this paper, we study the tedious link between the properties of sensi...
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
04/14/2022

Normalization by Evaluation for the Lambek Calculus

The syntactic calculus of Lambek is a deductive system for the multiplic...
research
07/31/2020

Language Models for Some Extensions of the Lambek Calculus

We investigate language interpretations of two extensions of the Lambek ...
research
11/13/2022

Factoring using multiplicative relations modulo n: a subexponential algorithm inspired by the index calculus

We demonstrate that a modification of the classical index calculus algor...
research
06/16/2022

Recursion does not always help

We show that, under mild assumptions, adding recursion does not increase...

Please sign up or login with your details

Forgot password? Click here to reset