On the recognizing power of the Lambek calculus with brackets

DOI10.1007/s10849-018-9269-3zbMath1427.03040arXiv1709.07695OpenAlexW2962739933WikidataQ129796794 ScholiaQ129796794MaRDI QIDQ1630945

Makoto Kanazawa

Publication date: 5 December 2018

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.07695

zbMATH Keywords

context-free languagesrecognizing powerLambek calculus with brackets

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Related Items (2)

The multiplicative-additive Lambek calculus with subexponential and bracket modalities ⋮ Non-associative, non-commutative multi-modal linear logic

Cites Work

• Unnamed Item
• Unnamed Item
• On the generative capacity of multi-modal categorial grammars
• Multimodal linguistic inference
• Computing interpolants in implicational logics
• Lambek Grammars with the Unit
• The Mathematics of Sentence Structure
• Product-free Lambek calculus and context-free grammars

This page was built for publication: On the recognizing power of the Lambek calculus with brackets