Compositionality in Context

Compositionality is a principle used in logic, philosophy, mathematics, linguistics, and computer science for assigning meanings to language expressions in a systematic manner following syntactic construction, thereby allowing for a perspicuous algebraic view of the syntax-semantics interface. Yet the status of the principle remains under debate, with positions ranging from compositionality always being achievable to its having genuine empirical content. This paper attempts to sort out some major issues in all this from a logical perspective. First, we stress the fundamental harmony between Compositionality and its apparent antipode of Contextuality that locates meaning in interaction with other linguistic expressions and in other settings than the actual one. Next, we discuss basic further desiderata in designing and adjudicating a compositional semantics for a given language in harmony with relevant contextual syntactic and semantic cues. In particular, in a series of concrete examples in the realm of logic, we point out the dangers of over-interpreting compositional solutions, the ubiquitous entanglement of assigning meanings and the key task of explaining given target inferences, and the dynamics of new language design, illustrating how even established compositional semantics can be rethought in a fruitful manner. Finally, we discuss some fresh perspectives from the realm of game semantics for natural and formal languages, the general setting for Samson Abramsky’s influential work on programming languages and process logics. We highlight outside-in coalgebraic perspectives on meanings as finite or infinitely unfolding behavior that might challenge and enrich current discussions of compositionality

A system of relational syllogistic incorporating full Boolean reasoning

We present a system of relational syllogistic, based on classical propositional logic, having primitives of the following form: Some A are R-related to some B; Some A are R-related to all B; All A are R-related to some B; All A are R-related to all B. Such primitives formalize sentences from natural language like `All students read some textbooks'. Here A and B denote arbitrary sets (of objects), and R denotes an arbitrary binary relation between objects. The language of the logic contains only variables denoting sets, determining the class of set terms, and variables denoting binary relations between objects, determining the class of relational terms. Both classes of terms are closed under the standard Boolean operations. The set of relational terms is also closed under taking the converse of a relation. The results of the paper are the completeness theorem with respect to the intended semantics and the computational complexity of the satisfiability problem.Comment: Available at http://link.springer.com/article/10.1007/s10849-012-9165-

Vagueness and Quantification

This paper deals with the question of what it is for a quantifier expression to be vague. First it draws a distinction between two senses in which quantifier expressions may be said to be vague, and provides an account of the distinction which rests on independently grounded assumptions. Then it suggests that, if some further assumptions are granted, the difference between the two senses considered can be represented at the formal level. Finally, it outlines some implications of the account provided which bear on three debated issues concerning quantification

Compositionality in Truth Conditional Pragmatics

In the past decade various linguists and philosophers (e.g. Pagin, Pelletier, Recanati, Westerståhl, Lasersohn) have proposed a weakening of the standard interpretation of compositionality for propositional content. Their move is motivated by the desire to accommodate radical forms of context sensitivity within a systematic account of natural languages. In this paper I argue against weakening compositionality in the way proposed by them. I argue that weak compositionality fails to provide some of the expected benefits of compositionality. First, weak compositionality fails to provide systematic meaning-rules which can handle forms of context-sensitivity that are not amenable to explanation in terms of a fixed and limited set of contextual parameters. Secondly, I argue that weak-compositionality fails to play any role in explaining speakers’ ability to calculate the semantic values of complex expressions. I conclude that weak compositionality is not a viable alternative to standard interpretations of compositionality, and that it doesn’t offer an acceptable way to accommodate radical forms of context-sensitivity within a systematic account of natural languages. Given the central role that weak-compositionality plays in recent approaches to natural language (e.g. in truth-conditional pragmatics) this also casts doubt on the viability of these projects