DeepAI AI Chat
Log In Sign Up

Eliminating the unit constant in the Lambek calculus with brackets

by   Stepan Kuznetsov, et al.

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).


page 1

page 2

page 3

page 4


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

Lambek calculus is a logical foundation of categorial grammar, a linguis...

On the Recognizing Power of the Lambek Calculus with Brackets

Every language recognized by the Lambek calculus with brackets is contex...

Language Models for Some Extensions of the Lambek Calculus

We investigate language interpretations of two extensions of the Lambek ...

AC Simplifications and Closure Redundancies in the Superposition Calculus

Reasoning in the presence of associativity and commutativity (AC) is wel...

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

We provide a plugin extracting Coq functions of simple polymorphic types...

A prototype-based approach to object reclassification

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

Space-Efficient Gradual Typing in Coercion-Passing Style

Herman et al. (2007, 2010) pointed out that the insertion of run-time ch...