When reasons are given for compositionality, the arguments usually purport to establish compositionality in an almost a priori manner. I will rehearse these arguments why one could think that compositionality is a priori true, or almost a priori true, and will find all of them inconclusive. This, in itself, is no reason against compositionality, but a reason to try to establish or defend the principle on other than quasi-a priori grounds.

The book is about logical analysis of natural language. Since we humans communicate by means of natural language, we need a tool that helps us to understand in a precise manner how the logical and formal mechanisms of natural language work. Moreover, in the age of computers, we need to communicate both with and through computers as well. Transparent Intensional Logic is a tool that is helpful in making our communication and reasoning smooth and precise. It deals with all kinds (...) of linguistic context in a fully compositional and anti-contextual way. (shrink)

Whether meaning is compositional has been a major issue in linguistics and formal philosophy of language for the last 2 decades. Semantic holism is widely and plausibly considered as an objection to the principle of semantic compositionality therein. It comes as a surprise that the holistic peculiarities of scientific language have been rarely addressed in formal accounts so far, given that semantic holism has its roots in the philosophy of science. For this reason, a model-theoretic approach to semantic holism in (...) the language of science is presented here. This approach preserves compositionality to a large extent. *Received September 2009; revised February 2010. †To contact the author, please write to: Seminar for Philosophy, Logic, and Theory of Science, Hauspostfach 49, Ludwig-Maximilians-Universität, Munich 80539, Germany; e-mail: [email protected]. (shrink)

Charles S. Peirce’s pragmatist theory of logic teaches us to take the context of utterances as an indispensable logical notion without which there is no meaning. This is not a spat against compositionality per se , since it is possible to posit extra arguments to the meaning function that composes complex meaning. However, that method would be inappropriate for a realistic notion of the meaning of assertions. To accomplish a realistic notion of meaning (as opposed e.g. to algebraic meaning), Sperber (...) and Wilson’s Relevance Theory (RT) may be applied in the spirit of Peirce’s Pragmatic Maxim (PM): the weighing of information depends on (i) the practical consequences of accommodating the chosen piece of information introduced in communication, and (ii) what will ensue in actually using that piece in further cycles of discourse. Peirce’s unpublished papers suggest a relevance-like approach to meaning. Contextual features influenced his logic of Existential Graphs (EG). Arguments are presented pro and con the view in which EGs endorse non-compositionality of meaning. (shrink)

The hybrid logic and the independence friendly modal logic IFML are compared for their expressive powers. We introduce a logic IFML c having a non-standard syntax and a compositional semantics; in terms of this logic a syntactic fragment of IFML is singled out, denoted IFML c . (In the Appendix it is shown that the game-theoretic semantics of IFML c coincides with the compositional semantics of IFML c .) The hybrid logic is proven to be strictly more expressive than IFML (...) c . By contrast, and the full IFML are shown to be incomparable for their expressive powers. Building on earlier research (Tulenheimo and Sevenster 2006), a PSPACE -decidable fragment of the undecidable logic is disclosed. This fragment is not translatable into the hybrid logic and has not been studied previously in connection with hybrid logics. In the Appendix IFML c is shown to lack the property of ‘quasi-positionality’ but proven to enjoy the weaker property of ‘ bounded quasi-positionality’. The latter fact provides from the IFML internal perspective an account of what makes the compositional semantics of IFML c possible. (shrink)

Endoporeutic method exemplifies the fundamental principle concerning the direction of the flow of interpretation in Peirce’s diagrammatic logic of existential graphs. It boils down to the fact that in EGs, one starts with the outermost graph-instance or the cut and proceeds inwards according to the conventions of EGs. The interpretation is dialogic, which Peirce laid out in his semeiotics in terms of two players, the Interpreter and the Utterer, and in EGs in terms of the Grapheus and the Graphist. Endoporeutic (...) method is thus closely related to semantic games. It is also an early sketch of model theory in logic, and marks an outlook on logic that puts the notion of compositionality under critical scrutiny. (shrink)

According to truth pluralism, sentences from different areas of discourse can be true in different ways. This view has been challenged to make sense of logical validity, understood as necessary truth preservation, when inferences involving different areas are considered. To solve this problem, a natural temptation is that of replicating the standard practice in many-valued logic by appealing to the notion of designated values. Such a simple approach, however, is usually considered a non-starter for strong versions of truth pluralism, since (...) designation seems to embody nothing but a notion of generic truth. In this paper, I explore the analogy with many-valued logic by comparing the problem of mixed inferences with Suszko’s thesis, and argue that the strong pluralist has room to resist the commitment to a generic property of truth by undermining the semantic significance of Suszko’s reduction. (shrink)

Sandu and Pietarinen [Partiality and Games: Propositional Logic. Logic J. IGPL 9 (2001) 101] study independence friendly propositional logics. That is, traditional propositional logic extended by means of syntax that allow connectives to be independent of each other, although the one may be subordinate to the other. Sandu and Pietarinen observe that the IF propositional logics have exotic properties, like functional completeness for three-valued functions. In this paper we focus on one of their IF propositional logics and study its properties, (...) by means of notions from computational complexity. This approach enables us to compare propositional logic before and after the IF make-over. We observe that all but one of the best-known decision problems experience a complexity jump, provided that the complexity classes at hand are not equal. Our results concern every discipline that incorporates some notion of independence such as computer science, natural language semantics, and game theory. A corollary of one of our theorems illustrates this claim with respect to the latter discipline. (shrink)

Charles Sanders Peirce was one of the United States’ most original and profound thinkers, and a prolific writer. Peirce’s game theory-based approaches to the semantics and pragmatics of signs and language, to the theory of communication, and to the evolutionary emergence of signs, provide a toolkit for contemporary scholars and philosophers. Drawing on unpublished manuscripts, the book offers a rich, fresh picture of the achievements of a remarkable man.

A semantics may be compositional and yet partial, in the sense that not all well-formed expressions are assigned meanings by it. Examples come from both natural and formal languages. When can such a semantics be extended to a total one, preserving compositionality? This sort of extension problem was formulated by Hodges, and solved there in a particular case, in which the total extension respects a precise version of the fregean dictum that the meaning of an expression is the contribution it (...) makes to the meanings of complex phrases of which it is a part. Hodges' result presupposes the so-called Husserl property, which says roughly that synonymous expressions must have the same category. Here I solve a different version of the compositional extension problem, corresponding to another type of linguistic situation in which we only have a partial semantics, and without assuming the Husserl property. I also briefly compare Hodges' framework for grammars in terms of partial algebras with more familiar ones, going back to Montague, which use many-sorted algebras instead. (shrink)