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

Authors:
Zhe Lin
Affiliations:
Institute of Logic and Cognition, Sun Yat-sen University, Guangzhou, China
Venue:
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Year:
2010

Citing 6
Cited 1

Linear logic

Theoretical Computer Science
Residuation, Structural Rules and Context Freeness

Journal of Logic, Language and Information
Lambek calculus is NP-complete

Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
S4 enriched multimodal categorial grammars are context-free

Theoretical Computer Science
Corrigendum: S4 enriched multimodal categorial grammars are context-free: Corrigendum

Theoretical Computer Science
Nonassociative Lambek Calculus with Additives and Context-Free Languages

Languages: From Formal to Natural

Distributive full nonassociative lambek calculus with s4-modalities is context-free

LACL'12 Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that the consequence relation of the Nonassociative Lambek Calculus with S4-modalities (NLS4) is polynomial time decidable and categorial grammars based on NLS4 with finitely many assumptions generate context-free languages. This extends earlier results of Buszkowski [3] for NL and Plummer [16][17] for a weaker version of NLS4 without assumptions.