Modal nonassociative Lambek calculus with assumptions: complexity and context-freeness

DOI10.1007/978-3-642-13089-2_35MaRDI QIDQ3564882zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Distributive full nonassociative Lambek calculus with \(\mathrm{S4}\)-modalities is context-free
• On the complexity of nonassociative Lambek calculus with unit
• scientific article; zbMATH DE number 1341472
• Complexity of Lambek calculi with modalities and of total derivability in grammars
• Nonassociative Lambek Calculus with Additives and Context-Free Languages

Cited in

(16)

• On the complexity of nonassociative Lambek calculus with unit
• Complexity of Lambek calculi with modalities and of total derivability in grammars
• On involutive nonassociative Lambek calculus
• S4 enriched multimodal categorial grammars are context-free
• Nonmodularity results for lambda calculus
• Undecidability of the Lambek calculus with a relevant modality
• Nonassociative Lambek Calculus with Additives and Context-Free Languages
• scientific article; zbMATH DE number 1341472 (Why is no real title available?)
• Non deterministic classical logic: the $\lambda\mu^{++}$-calculus
• Non‐associative Lambek Categorial Grammar in Polynomial Time
• Distributive full nonassociative Lambek calculus with \(\mathrm{S4}\)-modalities is context-free
• Non-associative Lambek calculus with modalities: interpolation, complexity and FEP
• Some syntactic interpretations in different systems of full Lambek calculus
• Undecidability of consequence relation in full non-associative Lambek calculus
• Sequent systems for consequence relations of cyclic linear logics
• S4 enriched multimodal categorial grammars are context-free: Corrigendum

This page was built for publication: Modal nonassociative Lambek calculus with assumptions: complexity and context-freeness

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