Eliminating the unit constant in the Lambek calculus with brackets
Logic in Computer Science
2017-11-20 v1 Logic
Abstract
We present a translation of the Lambek calculus with brackets and the unit constant, , into the Lambek calculus with brackets allowing empty antecedents, but without the unit constant, . Using this translation, we extend previously known results for to : (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).
Keywords
Cite
@article{arxiv.1711.06361,
title = {Eliminating the unit constant in the Lambek calculus with brackets},
author = {Stepan Kuznetsov},
journal= {arXiv preprint arXiv:1711.06361},
year = {2017}
}