Eliminating the unit constant in the Lambek calculus with brackets

11/17/2017
by   Stepan Kuznetsov, et al.
0

We present a translation of the Lambek calculus with brackets and the unit constant, Lb^*_1, into the Lambek calculus with brackets allowing empty antecedents, but without the unit constant, Lb^*. Using this translation, we extend previously known results for Lb^* to Lb^*_1: (1) languages generated by categorial grammars based on the Lambek calculus with brackets are context-free (Kanazawa 2017); (2) the polynomial-time algorithm for deciding derivability of bounded depth sequents (Kanovich et al. 2017).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/01/2017

A polynomial time algorithm for the Lambek calculus with brackets of bounded order

Lambek calculus is a logical foundation of categorial grammar, a linguis...
research
09/22/2017

On the Recognizing Power of the Lambek Calculus with Brackets

Every language recognized by the Lambek calculus with brackets is contex...
research
07/31/2020

Language Models for Some Extensions of the Lambek Calculus

We investigate language interpretations of two extensions of the Lambek ...
research
07/18/2021

AC Simplifications and Closure Redundancies in the Superposition Calculus

Reasoning in the presence of associativity and commutativity (AC) is wel...
research
04/26/2019

A certifying extraction with time bounds from Coq to call-by-value λ-calculus

We provide a plugin extracting Coq functions of simple polymorphic types...
research
08/07/2019

Space-Efficient Gradual Typing in Coercion-Passing Style

Herman et al. (2007, 2010) pointed out that the insertion of run-time ch...
research
08/13/2018

A prototype-based approach to object reclassification

We investigate, in the context of functional prototype-based lan- guages...

Please sign up or login with your details

Forgot password? Click here to reset