Hostname: page-component-848d4c4894-4rdrl Total loading time: 0 Render date: 2024-07-05T14:09:43.288Z Has data issue: false hasContentIssue false

Barbara H. Partee, Alice ter Meulen & Robert E. Wall, Mathematical methods in linguistics. (Studies in Linguistics and Philosophy, 30.) Dordrecht, Boston & London: Kluwer Academic, 1990. Pp. xx + 663.

Published online by Cambridge University Press:  28 November 2008

Geoffrey K. Pullum
Affiliation:
Cowell College, University of California, Santa Cruz.

Abstract

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Reviews
Copyright
Copyright © Cambridge University Press 1991

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

Barker, Chris & Pullum, Geoffrey K. (1990). A theory of command relations. Linguistics and Philosophy 13. 134.CrossRefGoogle Scholar
Barton, Edward L., Berwick, Robert C. & Ristad, Eric Sven (1987). Computational complexity and natural language. Cambridge, Mass.: MIT Press.Google Scholar
Gold, E. Mark (1967). Language identification in the limit. Information and Control 10. 447474.Google Scholar
Jordan, M. I. (1986). An introduction to linear algebra in parallel distributed processing. In Rumerlhart, David E., McClelland, James L. et al. , Parallel distributed processing: explorations in the microstructures of cognition, Vol. 1: Foundations. Cambridge, Mass.: MIT Press.Google Scholar
Kornai, András & Pullum, Geoffrey K. (1990). The X-bar theory of phrase structure. Lg 66. 2450.Google Scholar
Langendoen, D. Terence (1976). On the weak generative capacity of infinite grammars. CUNY Forum 1. 1324. New York: City University of New York.Google Scholar
Manaster-Ramer, Alexis (ed.) (1987). Malhematics of language. Amsterdam: John Benjamins.Google Scholar
Partee, Barbara Hall (1978). Fundamentals of mathematics for linguistics. Dordrecht: D. Reidel.Google Scholar
Peters, P. Stanley & Ritchie, Robert W. (1969). Context-sensitive immediate constituent analysis – context-free languages revisited. Conference record of the ACM Symposium on Theory of Computing. 18. Also Mathematical Systems Theory 6 (1973). 324–333.Google Scholar
Peters, P. Stanley & Uszkoreit, Hans (1986). On some formal properties of metarules. Linguistics and Philosophy 9. 477494.Google Scholar
Reyle, U. & Rohrer, C. (1987). Natural language parsing and linguistic theories. Dordrecht: D. Reidel.Google Scholar
Savitch, Walter J., Bach, Emmon, Marsh, William & Safran-Naveh, Gila (1987). The formal complexity of natural languages. Dordrecht: D. Reidel.Google Scholar
Solomonoff, R. J. (1964). A formal theory of inductive inference, Part I and Part II. Information and Control 7. 122, 224254.CrossRefGoogle Scholar
Thatcher, James W. (1972). Tree automata: an informal survey. In Aho, Alfred V. (ed.) Currents in the theory of Computing. Englewood Cliffs, N.J.: Prentice-Hall. 143172.Google Scholar
Wall, Robert E. (1972). Introduction to mathematical linguistics. Englewood Cliffs, N.J.: Prentice-Hall.Google Scholar
Wijngaarden, A. van (1969). Report on the algorithmic language ALGOL68. Numerische Mathematik 14. 79218.Google Scholar
Zwicky, Arnold M. (1971). Remarks on directionality. JL 8. 103110.Google Scholar