ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Theoretical Computer Science
Volume 388, Issues 1-3, 5 December 2007, Pages 173-180
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (232 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.tcs.2007.07.027    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2007 Elsevier Ltd All rights reserved.

S4 enriched multimodal categorial grammars are context-free

Andrew R. PlummerCorresponding Author Contact Information, a, E-mail The Corresponding Author

aDepartment of Mathematics and Statistics, University Plaza, Georgia State University, Atlanta, GA 30303, USA

Received 15 January 2007; 
revised 17 July 2007; 
accepted 17 July 2007. 
Communicated by A. Avron. 
Available online 28 July 2007.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

Bar-Hillel et al. [Y. Bar-Hillel, C. Gaifman, E. Shamir, On categorial and phrase structure grammars, Bulletin of the Research Council of Israel F (9) (1960) 1–16] prove that applicative categorial grammars weakly recognize the context-free languages. Buszkowski [W. Buszkowski, Generative capacity of non-associative Lambek calculus, Bulletin of the Polish Academy of Sciences: Mathematics 34 (1986) 507–518] proves that grammars based on the product-free fragment of the non-associative Lambek calculus NL recognize exactly the context-free languages. Kandulski [M. Kandulski, The equivalence of non-associative Lambek categorial grammars and context-free grammars, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 34 (1988) 41–52] furthers this result by proving that grammars based on NL also recognize exactly the context-free languages. Jäger [G. Jäger, Residuation, structural rules and context freeness, Journal of Logic, Language and Information 13 (2004) 47–59] proves that categorial grammars based on View the MathML source, the non-associative Lambek calculus enriched with residuated modalities, weakly recognize exactly the context-free languages. We extend this result, proving that categorial grammars based on View the MathML source, the enrichment of View the MathML source by the axioms 4 and T, weakly recognize exactly the context-free languages.

Keywords: Categorial grammar; Lambek grammar; Multimodal grammar; S4; Context-free language; Chomsky hierarchy


Theoretical Computer Science
Volume 388, Issues 1-3, 5 December 2007, Pages 173-180
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.