Abstract
We consider two formalisations of the notion of a compositionalsemantics for a language, and find some equivalent statements in termsof substitutions. We prove a theorem stating necessary and sufficientconditions for the existence of a “canonical” compositional semanticsextending a given partial semantics, after discussing what features onewould want such an extension to have. The theorem involves someassumptions about semantical categories in the spirit of Husserl andTarski.
Similar content being viewed by others
References
Bittner, M., 1995, “Quantification in Eskimo: A challenge for compositional semantics,” pp. 59–80 in Quantification in Natural Languages, E. Bach, E. Jelinek, A. Kratzer, and B. Partee, eds., Dordrecht: Kluwer Academic Publishers.
Frege, G., 1892, “Ñber Sinn und Bedeutung,” Zeitschrift für Philosophie und philosophische Kritik 100, 25–50. Translated as “On Sense and Reference,” pp. 23–45 in On Meaning and Reference, A.W. Moore, ed., Oxford: Oxford University Press, 1993.
Gazdar, G., Klein, E., Pullum, G., and Sag, I., 1985, Generalized Phrase Structure Grammar, Cambridge, MA: Harvard University Press.
Hintikka, J., 1996, The Principles of Mathematics Revisited, Cambridge: Cambridge University Press.
Hintikka, J. and Sandu, G., 1997, “Game-theoretical semantics,” pp. 361–410 in Handbook of Logic and Language, A. ter Meulen and J. van Benthem, eds., Amsterdam: Elsevier.
Hodges,W., 1993, “Logical features of Horn clauses,” pp. 449–503 in Handbook of Logic in Artificial Intelligence and Logic Programming, Volume 1: Logical Foundations, D. Gabbay, C. Hogger, and J. Robinson, eds., Oxford: Clarendon Press.
Hodges, W., 1997, “Some strange quantifiers,” pp. 51–65 in Structures in Logic and Computer Science, J. Mycielski, G. Rozenberg, and A. Salomaa, eds., Lecture Notes in Computer Science, Vol. 1261, Berlin: Springer-Verlag.
Hodges, W., 1998, “Compositionality is not the problem,” Logic and Logical Philosophy 6, 7–33.
Husserl, E., 1993, Logische Untersuchungen II/1, Tübingen: Max Niemeyer Verlag.
Lappin, S. and Zadrozny, A., 1999, “Compositionality, synonymy, and the systematic representation of meaning,” preprint.
Milner, R., 1977, “Fully abstract models of the typed lambda-calculus,” Theoretical Computer Science 4, 1–22.
Partee, B.H., ter Meulen, A., and Wall, R.E., 1990, Mathematical Methods in Linguistics, Dordrecht: Kluwer Academic Publishers.
Plotkin, G.D., 1977, “LCF considered as a programming language,” Theoretical Computer Science 5, 223–255.
Tarski, A., 1983, “The concept of truth in formalized languages,” pp. 152–278 in Logic, Semantics, Metamathematics, J. Corcoran, ed., Indianopolis: Hackett Publishing.
Tarski, A. and Vaught, R., 1957, “Arithmetical extensions of relational systems,” Compositio Mathematica 13, 81–102.
Westerstå hl, D., “On the compositionality of idioms. An abstract approach,” in Proceedings of LLC8, D. Barker-Plummer, D. Beaver, J. van Benthem, and P. Scotto di Luzio, eds., Stanford, CA: CSLI Publications, to appear.
Zadrozny, W., 1994, “From compositional to systematic semantics,” Linguistics and Philosophy 17, 329–342.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hodges, W. Formal Features of Compositionality. Journal of Logic, Language and Information 10, 7–28 (2001). https://doi.org/10.1023/A:1026502210492
Issue Date:
DOI: https://doi.org/10.1023/A:1026502210492