Peter Pagin

In earlier work (Glüer, K. and P. Pagin. 2006. Proper names and relational modality. Linguistics & Philosophy 29: 507–35; Glüer, K. and P. Pagin. 2008. Relational modality. Journal of Logic, Language and Information 17: 307–22), we developed a semantics for (metaphysical) modal operators that accommodates Kripkean intuitions about proper names in modal contexts even if names are not rigid designators. Graeme Forbes (2011. The problem of factives for sense theories. Analysis 71: 654–62.) criticizes our proposal. He argues that our semantics predicts readings for certain natural language sentences which these simply do not have. These sentences contain mixed contexts involving factive attitude verbs. We argue that the readings our semantics predicts do indeed exist, even if it might take a little work to bring them out. Moreover, denying their existence would have some rather unattractive consequences

Peter Pagin Is the principle of semantic compositionality compatible with the principle of semantic holism? The question is of interest, since both principles have a lot that speaks for them, and since they do seem to be in conflict. The view that natural languages have compositional structure is almost unavoidable, since linguistic communication by means of new combinations of words would be virtually incomprehensible otherwise. And holism too seems generally plausible, since the meaning of an expression is directly connected with the way that expression interacts with other.

In Michael Dummett’s manifestability challenge to truth conditional semantics, it is argued that the meaning of sentence cannot be its truth conditions, for then a speaker’s knowledge of the meaning would not in all cases be manifestable. In those cases, the speaker would not know how to find out whether the truth conditions are satisfied or not. By contrast, knowledge of what counts as a proof of a sentence would pass the manifestability test, since a speaker is supposed always to be capable of deciding whether or not a given object is a proof of a given sentence. There is a problem for the positive part, however, for there is no guarantee that a compositional proof-theoretic semantics in all cases provides knowledge sufficient for recognizing any proof of a provable sentence for which the meaning is given. In those cases, the speaker need not know how to find out whether a given object is a proof of the sentence. Hence, if knowledge of meaning is required to be manifestable, there is no guarantee in general is compositionally specifiable.

This article focuses on the relevance of computational complexity for cognition. The syntactic items may be expressions that are surface strings. But in general, strings are syntactically ambiguous in that they can be generated in more than one way from atomic expressions and operations. The semantic function must take disambiguated items as arguments. When expressions are ambiguous, expressions cannot be the arguments. Instead, it is common to take the arguments to be terms, whose surface syntax reflects the derivation of the string. The semantic function differs in one other important respect from an arithmetic function, since it maps entities between domains, from a syntactic to an ontic or conceptual domain of meanings. Compositionality helps to explain the rate of success in linguistic communication when the sentence used or the content communicated is new.