Abstract
We study Nonassociative Lambek Calculus with additives, satisfying the distributive law and S4-modalities. We prove that the categorial grammars based on it, also enriched with assumptions, generate context-free languages. This extends earlier results of Buszkowski [4] for NL (Nonassociative Lambek Calculus), Buszkowski and Farulewski [6] for DNFL (Distributive Full Nonassociative Lambek Calculus) and Plummer [19], [20] for NLS4 (Nonassociative Lambek Calculus with S4-modalities) without assumptions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Belardinelli, F., Jipsen, P., Ono, H.: Algebraic aspects of cut elimination. Studia Logica 77, 209â240 (2004)
Bernardi, R.: Reasoning with Polarity in Categorial Type Logic. PhD thesis, Utrecht (2002)
Buszkowski, W.: Generative Capacity of Nonassociative Lambek Calculus. Bulletin of Polish Academy of Sciences: Math 34, 507â516 (1986)
Buszkowski, W.: Lambek Calculus with Nonlogical Axioms. In: Casadio, C., Scott, P., Seely, R. (eds.) Languages and Grammars Studies in Mathematical Linguistics and Natural Language. CSLI Lectures Notes, vol. 168, pp. 77â93 (2005)
Buszkowski, W.: Interpolation and FEP for logic of residuated algebras. Logic Journal of the IGPLÂ 19(3), 437â454 (2011)
Buszkowski, W., Farulewski, M.: Nonassociative Lambek Calculus with Additives and Context-Free Languages. In: Grumberg, O., Kaminski, M., Katz, S., Wintner, S. (eds.) Francez Festschrift. LNCS, vol. 5533, pp. 45â58. Springer, Heidelberg (2009)
Heylen, D.: Types and Sorts Resource Logic for Feature Cheking. PhD thesis, Utrecht (1999)
JĂ€ger, G.: On the generative capacity of multi-modal categorial grammars. Research on Language and Computation 1, 105â125 (2003)
JĂ€ger, G.: Residuation, Structural Rules and Context Freeness. Journal of Logic, Language and Informationn 13, 47â59 (2004)
Kanazawa, M.: The Lambek Calculus enriched with Additional Connectives. Journal of Logic, Language and Information 1(2), 141â171 (1992)
Kandulski, M.: The equivalence of Nonassociative Lambek Categorial Grammars and Context-free Grammars. Zeitschrift fĂŒr Mathematische Logik und Grundlagen der Mathematik 52, 34â41 (1988)
Lambek, J.: The mathematics of sentence structure. American Mathematical Monthly 65, 154â170 (1958)
Lambek, J.: On the calculus of syntactic types. In: Structure of Language and Its Mathematical Aspects, pp. 168â178. American Mathematical Society (1961)
Lin, Z.: Modal Nonassociative Lambek Calculus with Assumptions: Complexity and Context-Freeness. In: Dediu, A.-H., Fernau, H., MartĂn-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 414â425. Springer, Heidelberg (2010)
Moortgat, M.: Multimodal linguistic inference. Journal of Logic, Language and Information 5, 349â385 (1996)
Moortgat, M.: Categorial types logic. In: van Benthem, J., ter Meulen, A. (eds.) Hand Book of Logic and Language, pp. 93â177. Elsevier (1997)
Morrill, G.: Categorial Grammar: Logical Syntax, Semantics, and Processing. Oxford University Press (2011)
Pentus, M.: Lambek grammars are context free. In: Proceedings of the 8th Annual IEEE Symposium on Logic in Computer Science, pp. 429â433 (1993)
Plummer, A.: S4 enriched multimodal categorial grammars are context-free. Theoretical Computer Science 388, 173â180 (2007)
Plummer, A.: S4 enriched multimodal categorial grammars are context-free: corrigendum. Theoretical Computer Science 403, 406â408 (2008)
Versmissen, J.: Grammatical Composition: Modes, Models, Modalities. PhD thesis, Universiteit Utrecht (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, Z. (2012). Distributive Full Nonassociative Lambek Calculus with S4-Modalities Is Context-Free. In: BĂ©chet, D., Dikovsky, A. (eds) Logical Aspects of Computational Linguistics. LACL 2012. Lecture Notes in Computer Science, vol 7351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31262-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-31262-5_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31261-8
Online ISBN: 978-3-642-31262-5
eBook Packages: Computer ScienceComputer Science (R0)