Lambek grammars with one division and one primitive type

DOI10.1093/jigpal/jzr031zbMath1259.03034OpenAlexW2026317051MaRDI QIDQ2903756

Stepan Kuznetsov

Publication date: 1 August 2012

Published in: Logic Journal of IGPL (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/jigpal/jzr031

zbMATH Keywords

context-free grammarsLambek calculusformal languagesproof netsLambek grammars

Mathematics Subject Classification ID

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

Related Items (5)

On translating context-free grammars into Lambek grammars ⋮ L-Completeness of the Lambek Calculus with the Reversal Operation Allowing Empty Antecedents ⋮ The multiplicative-additive Lambek calculus with subexponential and bracket modalities ⋮ Unnamed Item ⋮ COMPLEXITY OF THE INFINITARY LAMBEK CALCULUS WITH KLEENE STAR

This page was built for publication: Lambek grammars with one division and one primitive type