We discuss a well-known puzzle about the lexicalization of logical operators in natural language, in particular connectives and quantifiers. Of the many logically possible operators, only few appear in the lexicon of natural languages: the connectives in English, for example, are conjunction _and_, disjunction _or_, and negated disjunction _nor_; the lexical quantifiers are _all, some_ and _no_. The logically possible nand (negated conjunction) and Nall (negated universal) are not expressed by lexical entries in English, nor in any natural language. Moreover, (...) the lexicalized operators are all upward or downward monotone, an observation known as the Monotonicity Universal. We propose a logical explanation of lexical gaps and of the Monotonicity Universal, based on the dynamic behaviour of connectives and quantifiers. We define update potentials for logical operators as procedures to modify the context, under the assumption that an update by \( \phi \) depends on the logical form of \( \phi \) and on the speech act performed: assertion or rejection. We conjecture that the adequacy of update potentials determines the limits of lexicalizability for logical operators in natural language. Finally, we show that on this framework the Monotonicity Universal follows from the logical properties of the updates that correspond to each operator. (shrink)

Some arguments against the assumption that ordinary people may share common knowledge are sound. The apparent cost of such arguments is the rejection of scientific theories that appeal to common knowledge. My proposal is to accept the arguments without rejecting the theories. On my proposal, common knowledge is shared by ideally rational people, who are not just mathematically simple versions of ordinary people. They are qualitatively different from us, and theorizing about them does not lead to predictions about our behavior. (...) Nevertheless, models of action that assume common knowledge have a role to play in our understanding of collective rationality. (shrink)

According to the Maxim of Quality, rational agents tend to speak honestly. Due to the influence of Grice, a connection between linguistic rationality and honesty is often taken for granted. However, the connection is not obvious: structural rationality in language use does not require honesty, any more than it requires dishonesty. In particular, Quality does not follow from the Cooperative Principle and structural rationality. But then what is honest rational speech? I propose to move the discussion in the context of (...) Stalnaker's theory of assertion. From this perspective, although there is no most rational way to behave, Quality follows from the structure of Stalnakerian conversations if interlocutors are sensitive to credibility. In this case, honesty is built on the expectation of reciprocity, and cooperativity is an outcome and not a precondition of rational communication. A benefit of my discussion is that the account of linguistic rationality falls under the more general view of interactive rationality familiar from theoretical economics. (shrink)

The present work outlines a logical and philosophical conception of propositions in relation to a group of puzzles that arise by quantifying over them: the Russell-Myhill paradox, the Prior-Kaplan paradox, and Prior's Theorem. I begin by motivating an interpretation of Russell-Myhill as depending on aboutness, which constrains the notion of propositional identity. I discuss two formalizations of of the paradox, showing that it does not depend on the syntax of propositional variables. I then extend to propositions a modal predicative response (...) to the paradoxes articulated by an abstraction principle for propositions. On this conception, propositions are “shadows” of the sentences that express them. Modal operators are used to uncover the implicit relation of dependence that characterizes propositions that are about propositions. The benefits of this approach are shown by application to other intensional puzzles. The resulting view is an alternative to the plenitudinous metaphysics of impredicative comprehension principles. (shrink)

Natural language contains simple lexical items for some but not all Boolean operators. English, for example, contains conjunction and, disjunction or, negated disjunction nor, but no word to express negated conjunction *nand nor any other Boolean connective. Natural language grammar can be described by a logic that expresses what the lexicon can express by its primitives, and the rest compositionally. Such logic for propositional connectives is described here as a bilateral extension of update semantics. The basic intuition is that a (...) context can be updated by assertion or by rejection, and by one or multiple propositions at once. These distinctions suffice to characterize the logic of the lexicon. (shrink)

The ability to express negation in language may have been the result of an adaptive process. However, there are different accounts of adaptation in linguistics, and more than one of them may describe the case of negation. In this paper, I distinguish different versions of the claim that negation is adaptive and defend a proposal, based on recent work by Steinert-Threlkeld (2016) and Incurvati and Sbardolini (2021), on which negation is an indirect adaptation.

Communication facilitates coordination, but coordination might fail if there's too much uncertainty. I discuss a scenario in which vagueness-driven uncertainty undermines the possibility of publicly sharing a belief. I then show that asserting an epistemic modal sentence, 'Might p', can reveal the speaker's uncertainty, and that this may improve the chances of coordination despite the lack of a common epistemic ground. This provides a game-theoretic rationale for epistemic modality. The account draws on a standard relational semantics for epistemic modality, Stalnaker's (...) theory of assertion as informative update, and a Bayesian framework for reasoning under uncertainty. (shrink)

Why do we use epistemic modals like 'might'? According to Factualism, the function of 'might' is to exchange information about state-of-affairs in the modal universe. As an alternative to Factualism, this paper offers a game-theoretic rationale for epistemic possibility operators in a Bayesian setting. The background picture is one whereby communication facilitates coordination, but coordination could fail if there's too much uncertainty, since the players' ability to share a belief is undermined. However, 'might' and related expressions can be used to (...) reveal one's uncertainty, and exploit this to coordinate despite the lack of a common epistemic ground. The final result is a way to articulate a non-Factualist view of epistemic possibility modals that builds on their standard semantics. (shrink)

There is an apparent dilemma for hierarchical accounts of propositions, raised by Bruno Whittle : either such accounts do not offer adequate treatment of connectives and quantifiers, or they eviscerate the logic. I discuss what a plausible hierarchical conception of propositions might amount to, and show that on that conception, Whittle’s dilemma is not compelling. Thus, there are good reasons why proponents of hierarchical accounts of propositions did not see the difficulty Whittle raises.