The complexity of multiplicative-additive Lambek calculus: 25 years later

DOI10.1007/978-3-662-59533-6_22OpenAlexW2951185660MaRDI QIDQ2303602

Stepan Kuznetsov, Andrej Scedrov, Max I. Kanovich

Publication date: 4 March 2020

Full work available at URL: https://doi.org/10.1007/978-3-662-59533-6_22

zbMATH Keywords

completenessLambek calculusPSPACE-completenessLambek grammars

Mathematics Subject Classification ID

Logic in computer science (03B70)

Related Items (4)

Logical foundations for hybrid type-logical grammars ⋮ Commutative Lambek grammars ⋮ Infinitary action logic with exponentiation ⋮ COMPLEXITY OF THE INFINITARY LAMBEK CALCULUS WITH KLEENE STAR

This page was built for publication: The complexity of multiplicative-additive Lambek calculus: 25 years later