References
Aho, A. V. Indexed grammars—an extension of context-free grammars.Journal of the Association for Computing Machinery 75(1968), 647–671.
Gazdar, G., Klein, E., Pullum, G. K., and Sag, I. A.Generalized Phrase Structure Grammar. Harvard University Press, Cambridge, MA, 1985.
Hayashi, T. On derivation trees of indexed grammars—an extension of the uvwxytheorem.Publications of the Research Institute for Mathematical Sciences, Kyoto University 9 (1973), 61–92.
Immerman, N.Descriptive Complexity. Springer-Verlag, Berlin, 1998.
Joshi, A. K. Tree adjoining grammars: how much context-sensitivity is required to provide reasonable structural descriptions? InNatural Language Parsing: Psychological, Computational and Theoretical Perspectives, D. Dowty, L. Karttunen, and A. Zwicky, Eds. Cambridge University Press, Cambridge, 1985, pp. 206–250.
Levelt, W. J. M.Formal Grammars in Linguistics and Psycholinguistics, 3 volumes ed. Mouton, The Hague, 1974.
Marsh, W., and Partee, B. H. How noncontext-free is variable binding? InProceedings of the West Coast Conference on Formal Linguistics, Volume Three, M. Cobler, S. MacKaye, and M. T. Wescoat, Eds. CSLI Publications, Stanford, California, 1984, pp. 179–190.
Montague, R.Formal Philosophy. Yale University Press, New Haven, 1974.
Partee, B. H., ter Meulen, A., and Wall, R. E.Mathematical Foundations for Linguistics. Kluwer Academic, Dordrecht, 1990.
Peters, P. S., and Ritchie, R. W. On restricting the base component of transformational grammars.Information and Control 18 (1969), 483–501.
Postal, P. M., and Pullum, G. K. The contraction debate.Linguistic Inquiry 13 (1982), 122–138.
Pullum, G. K. The morpholexical nature of to-contraction.Language 73 (1997), 79–102.
Pullum, G. K., and Scholz, B. C. Contrasting applications of logic in natural language syntactic description. InProceedings of the 13th International Congress of Logic, Methodology and Philosophy of Science, P. Hajek, L. Valdes-Villanueva, and D. Westerstahl, Eds. KCL Publications, London, 2005.
Rogers, J.A Descriptive Approach to Language-Theoretic Complexity. CSLI Publications, Stanford, CA, 1998.
Rogers, J. The descriptive complexity of generalized local sets. InThe Mathematics of Syntactic Structure: Trees and their Logics, H.-P. Kolb and U. Mönnich, Eds., no. 44 in Studies in Generative Grammar. Mouton de Gruyter, Berlin, 1999, pp. 21–40.
Rounds, W. C. Complexity of recognition in intermediate-level languages.In Proceedings of the 14th Annual IEEE Symposium on Switching and Automata Theory Northridge, CA IEEE (1973), pp. 145–158.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Pullum, G.K. The mathematics of language. The Mathematical Intelligencer 28, 74–78 (2006). https://doi.org/10.1007/BF02987162
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02987162