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

DOI10.1007/978-3-662-59533-6_22MaRDI QIDQ2303602zbMATH OpenOpenAlexFDO

Authors Stepan Kuznetsov, Max Kanovich, Andre Scedrov

Publication date 4 March 2020

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

zbMATH Keywords

completenessLambek calculusLambek grammarsPSPACE-completeness

Mathematics Subject Classification ID

Logic in computer science (03B70)

Recommendations

• scientific article; zbMATH DE number 1341928
• Complexity of the Lambek calculus and its fragments
• The Lambek calculus enriched with additional connectives
• Complexity of Lambek calculi with modalities and of total derivability in grammars
• Language models for some extensions of the Lambek calculus

Cited in

(6)

• On the complexity of nonassociative Lambek calculus with unit
• Infinitary action logic with exponentiation
• Logical foundations for hybrid type-logical grammars
• Language models for some extensions of the Lambek calculus
• Complexity of the infinitary Lambek calculus with Kleene star
• Commutative Lambek grammars

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2303602)