Modal Nonassociative Lambek Calculus with Assumptions: Complexity and Context-Freeness

DOI10.1007/978-3-642-13089-2_35zbMath1284.03156OpenAlexW1546656712MaRDI QIDQ3564882

Zhe Lin

Publication date: 26 May 2010

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13089-2_35

Mathematics Subject Classification ID

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

Related Items (1)

Some Syntactic Interpretations in Different Systems of Full Lambek Calculus

This page was built for publication: Modal Nonassociative Lambek Calculus with Assumptions: Complexity and Context-Freeness