According to an influential recent view, S is propositionally justified in believing p iff S is in no position to know that S is in no position to know p. I argue that this view faces compelling counterexamples.

This thesis is about indicative conditionals and apparent counterexamples to classically valid argument forms. Specifically, it applies the following four theories: - material (inspired by Grice (1961, 1975 and 1989)); - possible-worlds (inspired by Stalnaker (1981); Lewis (1976); and Kratzer (2012)), - suppositional (inspired by Adams (1975) and Edgington (1995 and 2014)); and - hybrid (inspired by Jackson (1987)) to try and solve the following two counterexamples: - Vann McGee’s to modus ponens (1985); and - Lewis Carroll’s to modus tollens (...) (1894). I argue that none of the theories I consider can explain – without facing any problems – the three individually plausible but jointly inconsistent theses that give rise to the apparent counterexamples. The three theses of the trilemma are the following: (1) the argument is invalid; (2) the argument is an instance of modus ponens or modus tollens; and (3) modus ponens or modus tollens is valid. (shrink)

This volume is a collation of original contributions from the key actors of a new trend in the contemporary theory of knowledge and belief, that we call “dynamic epistemology”. It brings the works of these researchers under a single umbrella by highlighting the coherence of their current themes, and by establishing connections between topics that, up until now, have been investigated independently. It also illustrates how the new analytical toolbox unveils questions about the theory of knowledge, belief, preference, action, and (...) rationality, in a number of central axes in dynamic epistemology: temporal, social, probabilistic and even deontic dynamics. (shrink)

– We offer a new motivation for imprecise probabilities. We argue that there are propositions to which precise probability cannot be assigned, but to which imprecise probability can be assigned. In such cases the alternative to imprecise probability is not precise probability, but no probability at all. And an imprecise probability is substantially better than no probability at all. Our argument is based on the mathematical phenomenon of non-measurable sets. Non-measurable propositions cannot receive precise probabilities, but there is a natural (...) way for them to receive imprecise probabilities. The mathematics of non-measurable sets is arcane, but its epistemological import is far-reaching; even apparently mundane propositions are liable to be affected by non-measurability. The phenomenon of non-measurability dramatically reshapes the dialectic between critics and proponents of imprecise credence. Non-measurability offers natural rejoinders to prominent critics of imprecise credence. Non-measurability even reverses some of the critics’ arguments—by the very lights that have been used to argue against imprecise credences, imprecise credences are better than precise credences. (shrink)

In this paper we exploit the notions of conjoined and iterated conditionals, which are defined in the setting of coherence by means of suitable conditional random quantities with values in the interval [0,1]. We examine the iterated conditional (B|K)|(A|H), by showing that A|H p-entails B|K if and only if (B|K)|(A|H) = 1. Then, we show that a p-consistent family F={E1|H1, E2|H2} p-entails a conditional event E3|H3 if and only if E3|H3= 1, or (E3|H3)|QC(S) = 1 for some nonempty subset S (...) of F, where QC(S) is the quasi conjunction of the conditional events in S. Then, we examine the inference rules And, Cut, Cautious Monotonicity, and Or of System P and other well known inference rules (Modus Ponens, Modus Tollens, Bayes). We also show that QC(F)|C(F) = 1, where C(F) is the conjunction of the conditional events in F. We characterize p-entailment by showing that F p-entails E3|H3 if and only if (E3|H3)|C(F) = 1. Finally, we examine Denial of the antecedent and Affirmation of the consequent, where the p-entailment of (E3|H3) from F does not hold, by showing that (E3|H3)|C(F) is not equal to 1. (shrink)

Various semantics for studying the square of opposition have been proposed recently. So far, only [14] studied a probabilistic version of the square where the sentences were interpreted by (negated) defaults. We extend this work by interpreting sentences by imprecise (set-valued) probability assessments on a sequence of conditional events. We introduce the acceptability of a sentence within coherence-based probability theory. We analyze the relations of the square in terms of acceptability and show how to construct probabilistic versions of the square (...) of opposition by forming suitable tripartitions. Finally, as an application, we present a new square involving generalized quantifiers. (shrink)

Conditional judgements—judgements employing ‘if’—are essential to practical reasoning about what to do, as well as to much reasoning about what is the case. We handle them well enough from an early...

According to orthodoxy, there are two basic moods of supposition: indicative and subjunctive. The most popular formalizations of the corresponding norms of suppositional judgement are given by Bayesian conditionalization and Lewisian imaging, respectively. It is well known that Bayesian conditionalization can be generalized (via Jeffrey conditionalization) to provide a model for the norms of partial indicative supposition. This raises the question of whether imaging can likewise be generalized to model the norms of ‘partial subjunctive supposition’. The present article casts doubt (...) on whether the most natural generalizations of imaging are able to provide a plausible account of the norms of partial subjunctive supposition. (shrink)

ABSTRACT A trivalent theory of indicative conditionals automatically enforces Stalnaker's thesis – the equation between probabilities of conditionals and conditional probabilities. This result holds because the trivalent semantics requires, for principled reasons, a modification of the ratio definition of conditional probability in order to accommodate the possibility of undefinedness. I explain how this modification is motivated and how it allows the trivalent semantics to avoid a number of well-known triviality results, in the process clarifying why these results hold for many (...) bivalent theories. In short, the slew of triviality results published in the last 40-odd years need not be viewed as an argument against Stalnaker's thesis: it can be construed instead as an argument for abandoning the bivalent requirement that indicative conditionals somehow be assigned a truth-value in worlds in which their antecedents are false. (shrink)

The 3sg pronouns “he” and “she” impose descriptive gender conditions on their referents. These conditions are standardly analysed as presuppositions. Cooper argues that, when 3sg pronouns occur free, they have indexical presuppositions: the gender condition must be satisfied by the pronoun’s referent in the actual world. In this paper, we consider the behaviour of free 3sg pronouns in conditionals and focus on cases in which the pronouns’ gender presuppositions no longer seem to be indexical and project locally instead. We compare (...) these cases to previously reported shifty readings of indexicals in so-called “epistemic conditionals” :359–406, 2012) and propose a unified account of locally projected gender presuppositions and shifty indexicals based on the idea that indicative conditionals are Kaplanian monsters. (shrink)

It is commonly accepted that unconditional statements are clearer and less problematic than conditional ones. This article challenges this belief by proposing that all unconditional statements can be reduced to conditional ones since epistemic justification is inherently conditional in nature. The distinction between unconditional and conditional statements is similar to the distinction between assumptions and premises, which is an idealization that results from our attempts to limit epistemic complexity. This has perplexing consequences: (1) since any ordinary statement can be viewed (...) as a disguised conditional, this sets off a chain of epistemic regress that results in a larger conditional that encompasses our entire belief systems; (2) this monster conditional can’t never be justified since it always expands in the process of justification; (3) since there is no such thing as unconditional statements, conditionals themselves become meaningless, which implies that arguments and even entire belief systems become meaningless as well; (4) the only way to avoid these disastrous results is to admit that the meaning of conditionals and, ultimately, of our belief systems is a matter of convention. (shrink)

Richard Bradley’s landmark book Decision Theory with a Human Face makes seminal contributions to nearly every major area of decision theory, as well as most areas of formal epistemology and many areas of semantics. In addition to sketching Bradley’s distinctive semantics for conditional beliefs and desires, I will explain his theory of conditional desire, focusing particularly on his claim that we should not desire events, either positively or negatively, under the supposition that they will occur. I shall argue, to the (...) contrary, that permitting non-trivial desirabilities for events whose occurrence is known or assumed is both more intuitively plausible and more theoretically fruitful than Bradley’s approach. In the course of the discussion I will contrast Bradley’s broadly evidentialist picture of decision theory with my own more orthodox causal approach. (shrink)

This article is concerned with the principle of compositionality, i.e. the principle that the meaning of a complex expression is a function of the meanings of its parts and its mode of composition. After a brief historical background, a formal algebraic framework for syntax and semantics is presented. In this framework, both syntactic operations and semantic functions are partial. Using 20 the framework, the basic idea of compositionality is given a precise statement, and several variants, both weaker and stronger, as (...) well as related properties, are distinguished. Several arguments for compositionality are discussed, and the standard arguments are found inconclusive. Also, several arguments against compositionality, and for the claim that it is a trivial property, are discussed, 25 and are found to be flawed. Finally, a number of real or apparent problems for compositionality are considered, and some solutions are proposed. (shrink)

Many have accepted that ordinary counterfactuals and might counterfactuals are duals. In this paper, I show that this thesis leads to paradoxical results when combined with a few different unorthodox yet increasingly popular theses, including the thesis that counterfactuals are strict conditionals. Given Duality and several other theses, we can quickly infer the validity of another paradoxical principle, ‘The Counterfactual Direct Argument’, which says that ‘A> ’ entails ‘A> ’. First, I provide a collapse theorem for the ‘counterfactual direct argument’. (...) The counterfactual direct argument entails the logical equivalence of the subjunctive and material conditional, given a variety of assumptions. Second, I provide a semantics that validates the counterfactual direct argument without collapse. This theory further develops extant dynamic accounts of conditionals. I give a new semantics for disjunction, on which A or B is only true in a context when A and B are both unsettled. The resulting framework validates CDA while invalidating other commonly accepted principles concerning the conditional and disjunction. (shrink)

The semantics Vann McGee gives for his 1989 conditional logic is based on Stalnaker’s 1968 semantics but replaces the familiar concept of truth at a world with the novel concept of truth under a hypothesis. Developed here is a semantics of the standard type, in which sentences are true at worlds, only with additional constraints imposed on the accessibility relation and the selection function. McGee conditionals of the form A ⇒ X are translated into Stalnaker conditionals of the form \A (...) > X. An interpretation of the semantics is provided, and a few implications for the theory of indicative conditionals and their probabilities are noted. (shrink)

Bradley offers a quick and convincing argument that no Boolean semantic theory for conditionals can validate a very natural principle concerning the relationship between credences and conditionals. We argue that Bradley’s principle, Preservation, is, in fact, invalid; its appeal arises from the validity of a nearby, but distinct, principle, which we call Local Preservation, and which Boolean semantic theories can non-trivially validate.

Import-Export says that a conditional 'If p, if q, r' is always equivalent to the conditional 'If p and q, r'. I argue that Import-Export does not sit well with a classical approach to conjunction: given some plausible and widely accepted principles about conditionals, Import-Export together with classical conjunction leads to absurd consequences. My main goal is to draw out these surprising connections. In concluding I argue that the right response is to reject Import-Export and adopt instead a limited version (...) which better fits natural language data; accounts for all the intuitions that motivate Import-Export in the first place; and fits better with a classical conjunction. (shrink)

There is a renewed debate about modus ponens. Strikingly, the recent counterexamples in Cantwell, Dreier and MacFarlane and Kolodny are generated by restricted readings of the ‘if’-clause. Moreover, it can be argued on general grounds that the restrictor view of conditionals developed in Kratzer and Lewis leads to counterexamples to modus ponens. This paper provides a careful analysis of modus ponens within the framework of the restrictor view. Despite appearances to the contrary, there is a robust sense in which modus (...) ponens is valid, owing to the fact that conditionals do not only allow for restricted readings but have bare interpretations, too. (shrink)

Why should we believe that perceptions justify beliefs? One argument starts with the premise that sentences of the form “a looks F” may be used to justify conclusions of the form “a is F”. I will argue that this argument for the claim that perceptions justify beliefs founders on the following dilemma: Either “a looks F” does not report the content of a perception or, if it does, then it does not justify the conclusion “a is F”.

There seem to be two ways of supposing a proposition: supposing “indicatively” that Shakespeare didn’t write Hamlet, it is likely that someone else did; supposing “subjunctively” that Shakespeare hadn’t written Hamlet, it is likely that nobody would have written the play. Let P be the probability of B on the subjunctive supposition that A. Is P equal to the probability of the corresponding counterfactual, A □→B? I review recent triviality arguments against this hypothesis and argue that they do not succeed. (...) On the other hand, I argue that even if we can equate P with P, we still need an account of how subjunctive conditional probabilities are related to unconditional probabilities. The triviality arguments reveal that the connection is not as straightforward as one might have hoped. (shrink)

In addition to beliefs, people have attitudes of confidence called credences. Combinations of credences, like combinations of beliefs, can be inconsistent. It is common to use tools from probability theory to understand the normative relationships between a person’s credences. More precisely, it is common to think that something is a consistency norm on a person’s credal state if and only if it is a simple transformation of a truth of probability. Though it is common to challenge the right-to-left direction of (...) this biconditional, I argue in this paper that the left-to-right direction is false for standard versions of probability theory. That is, I make the case that there are consistency constraints on credal states that are not simple transformations of truths of standard versions of probability theory. I do so by drawing on a newly discovered type of credal attitude, a quantificational credence, and by showing how the consistency norms on this attitude can’t be represented as simple transformations of truths of standard versions of probability theory. I conclude by showing that a probability theory that could avoid the result would have to be strikingly different from the standard versions—so different that I suspect many would hesitate to call it a theory of probability at all. (shrink)

Does the desirability of a proposition depend on whether it is true? Not according to the Invariance assumption, held by several notable philosophers. The Invariance assumption plays an important role in David Lewis’ famous arguments against the so-called Desire-as-Belief thesis (DAB), an anti-Humean thesis according to which a rational agent desires a proposition exactly to the degree that she believes the proposition to be desirable. But the assumption is of interest independently of Lewis’ arguments, for instance since both Richard Jeffrey (...) and James Joyce make the assumption (or, strictly speaking, accept a thesis that implies Invariance) in their influential books on decision theory. The main claim to be defended in this paper is that Invariance is incompatible with certain assumptions of decision theory. I show that the assumption fails on the most common interpretations of desirability and/or choice-worthiness found in decision theory. I moreover show that Invariance is inconsistent with Richard Jeffrey’s decision theory, on which Lewis’ arguments against DAB are based. Finally, I show that Invariance contradicts how we in general do and should think about conditional desirability. (shrink)

Most meanings we express belong to large families of variant meanings, among which it would be implausible to suppose that some are much more apt for being expressed than others. This abundance of candidate meanings creates pressure to think that the proposition attributing any particular meaning to an expression is modally plastic: its truth depends very sensitively on the exact microphysical state of the world. However, such plasticity seems to threaten ordinary counterfactuals whose consequents contain speech reports, since it is (...) hard to see how we could reasonably be confident in a counterfactual whose consequent can be true only if a certain very finely tuned microphysical configuration obtains. This essay develops the foregoing puzzle and explores several possible solutions. (shrink)

The recent literature offers several models of the notion of matter of fact supposition1 revealed in the acceptance of the so-called indicative conditionals. Some of those models are qualitative [Collins 90], [Levi 96], [Stalnaker 84]. Other probabilistic models appeal either to infinitesimal probability or two place probability functions. Recent work has made possible to understand which is the exact qualitative counterpart of the latter probabilistic models. In this article we show that the qualitative notion of change that thus arises is (...) hypothetical revision, a notion previously axiomatized in [Arló-Costa 97] and [Arló-Costa & Thomason 96]. This notion is incompatible with AGM as well as with other standard methods of theory change. The way in which matter-of-fact supposition is modeled by hypothetical revision is illustrated via examples. The model is compared with other qualitative accounts of the notion of supposition encoded in two-place probability functions, with models of subjunctive supposition, as well as with some of the well know models of learning. Applications in knowledge representation and in the theory of games and decisions are summarized. (shrink)

I provide an interpretation of Wittgenstein's much criticized remarks on Gödel's First Incompleteness Theorem in the light of paraconsistent arithmetics: in taking Gödel's proof as a paradoxical derivation, Wittgenstein was right, given his deliberate rejection of the standard distinction between theory and metatheory. The reasoning behind the proof of the truth of the Gödel sentence is then performed within the formal system itself, which turns out to be inconsistent. I show that the models of paraconsistent arithmetics (obtained via the Meyer-Mortensen (...) collapsing filter on the standard model) match with many intuitions underlying Wittgensteins philosophy of mathematics, such as its strict finitism and the insistence on the decidability of any meaningful mathematical question. (shrink)

A proof by Allan Gibbard (Ifs: Conditionals, beliefs, decision, chance, time. Reidel, Dordrecht, 1981) seems to demonstrate that if indicative conditionals have truth conditions, they cannot be stronger than material implication. Angelika Kratzer's theory that conditionals do not denote two-place operators purports to escape this result [see Kratzer (Chic Linguist Soc 22(2):1–15, 1986, 2012)]. In this note, I raise some trouble for Kratzer’s proposed method of escape and then show that her semantics avoids this consequence of Gibbard’s proof by denying (...) modus ponens. I also show that the same holds for Anthony Gillies’ semantics (Philos Rev 118(3):325–349, 2009) and argue that this consequence of these theories is not obviously prohibitive—hence, both remain viable theories of indicative conditionals. (shrink)

According to the Ramsey Test, conditionals reflect changes of beliefs: α > β is accepted in a belief state iff β is accepted in the minimal revision of it that is necessary to accommodate α. Since Gärdenfors’s seminal paper of 1986, a series of impossibility theorems (“triviality theorems”) has seemed to show that the Ramsey test is not a viable analysis of conditionals if it is combined with AGM-type belief revision models. I argue that it is possible to endorse that (...) Ramsey test for conditionals while staying true to the spirit of AGM. A main focus lies on AGM’s condition of Preservation according to which the original belief set should be fully retained after a revision by information that is consistent with it. I use concrete representations of belief states and (iterated) revisions of belief states as semantic models for (nested) conditionals. Among the four most natural qualitative models for iterated belief change, two are identified that indeed allow us to combine the Ramsey test with Preservation in the language containing only flat conditionals of the form α > β. It is shown, however, that Preservation for this simple language enforces a violation of Preservation for nested conditionals of the form α > (β > γ). In such languages, no two belief sets are ordered by strict subset inclusion. I argue that it has been wrong right from the start to expect that Preservation holds in languages containing nested conditionals. (shrink)

What should we do when we won't do as we ought? Suppose it ought to be that the procrastinating professor accept the task of reviewing a book, and actually review the book. It seems clear that given he won't review it, he ought not to accept the task. That is a genuine moral obligation in light of less than perfect circumstances. I want to entertain the possibility that a set of such obligations form something like a 'practical morality'; that which (...) we ought to do given that we're unlikely or unwilling to do much of what ideal morality demands. If it is possible to give a coherent account of these kinds of obligations, then it is possible to entertain the idea that these obligations are in fact what morality demands. The conceptual truths about justice (good, right, fairness) that come from ideals are one thing; the actions that morality demands of people given their actual circumstances are quite another. In this paper I will ask about the kinds of facts that can be used to establish a more circumscribed set of obligations than we get from the orthodox view about moral obligation. (shrink)

This paper develops a probabilistic model of belief change under interpretation shifts, in the context of a problem case from dynamic epistemic logic. Van Benthem [4] has shown that a particular kind of belief change, typical for dynamic epistemic logic, cannot be modelled by standard Bayesian conditioning. I argue that the problems described by van Benthem come about because the belief change alters the semantics in which the change is supposed to be modelled: the new information induces a shift in (...) the interpretation of the sentences. In this paper I show that interpretation shifts can be modeled in terms of updating by conditioning. The model derives from the knowledge structures developed by Fagin et al [8], and hinges on a distinction between the propositional and informational content of sentences. Finally, I show that Dempster-Shafer theory provides the appropriate probability kinematics for the model. (shrink)

We investigate a basic probabilistic dynamic semantics for a fragment containing conditionals, probability operators, modals, and attitude verbs, with the aim of shedding light on the prospects for adding probabilistic structure to models of the conversational common ground.

One interpretation of the conditional If P then Q is as saying that the probability of Q given P is high. This is an interpretation suggested by Adams (1966) and pursued more recently by Edgington (1995). Of course, this probabilistic conditional is nonmonotonic, that is, if the probability of Q given P is high, and R implies P, it need not follow that the probability of Q given R is high. If we were confident of concluding Q from the fact (...) that we knew P, and we have stronger information R, we can no longer be confident of Q. We show nonetheless that usually we would still be justified in concluding Q from R. In other words, probabilistic conditionals are mostly monotonic. (shrink)

This paper uses Popper's treatment of probability and an epistemic constraint on probability assignments to conditionals to extend the Bayesian representation of rational belief so that revision of previously accepted evidence is allowed for. Results of this extension include an epistemic semantics for Lewis' theory of counterfactual conditionals and a representation for one kind of conceptual change.

This paper is obsolete. It is superseded by the book, Conditionals in Context, MIT Press, 2005.

Adams' famous thesis that the probabilities of conditionals are conditional probabilities is incompatible with standard probability theory. Indeed it is incompatible with any system of monotonic conditional probability satisfying the usual multiplication rule for conditional probabilities. This paper explores the possibility of accommodating Adams' thesis in systems of non-monotonic probability of varying strength. It shows that such systems impose many familiar lattice theoretic properties on their models as well as yielding interesting logics of conditionals, but that a standard complementation operation (...) cannot be defined within them, on pain of collapsing probability into bivalence. (shrink)

Christoph Jäger has argued that Dretske’s information-based account of knowledge is committed to both knowledge and information closure under known entailment. However, in a reply to Jäger, Dretske defended his view on the basis of a discrepancy between the relation of information and the relation of logical implication. This paper shares Jäger’s criticism that Dretske’s externalist notion of information implies closure, but provides an analysis based on different grounds. By means of a distinction between two perspectives, the mathematical perspective and (...) the epistemological perspective, I present, in the former, a notion of logical implication that is compatible with the notion of information in the mathematical theory of information, and I show how, in the latter, Dretske’s logical reading of the closure principle is incompatible with his information-theoretic epistemological framework. (shrink)

Asserting is the act of claiming that something is the case—for instance, that oranges are citruses, or that there is a traffic congestion on Brooklyn Bridge (at some time). We make assertions to share information, coordinate our actions, defend arguments, and communicate our beliefs and desires. Because of its central role in communication, assertion has been investigated in several disciplines. Linguists, philosophers of language, and logicians rely heavily on the notion of assertion in theorizing about meaning, truth and inference. -/- (...) The nature of assertion and its relation to other speech acts and linguistic phenomena (implicatures, presuppositions, etc.) have been subject to much controversy. This entry will situate assertion within speech act theory and pragmatics more generally, and then go on to present the current main accounts of assertion. (shrink)

We define a model for computing probabilities of right-nested conditionals in terms of graphs representing Markov chains. This is an extension of the model for simple conditionals from Wójtowicz and Wójtowicz. The model makes it possible to give a formal yet simple description of different interpretations of right-nested conditionals and to compute their probabilities in a mathematically rigorous way. In this study we focus on the problem of the probabilities of conditionals; we do not discuss questions concerning logical and metalogical (...) issues such as setting up an axiomatic framework, inference rules, defining semantics, proving completeness, soundness etc. Our theory is motivated by the possible-worlds approach ; however, our model is generally more flexible. In the paper we focus on right-nested conditionals, discussing them in detail. The graph model makes it possible to account in a unified way for both shallow and deep interpretations of right-nested conditionals. In particular, we discuss the status of the Import-Export Principle and PCCP. We briefly discuss some methodological constraints on admissible models and analyze our model with respect to them. The study also illustrates the general problem of finding formal explications of philosophically important notions and applying mathematical methods in analyzing philosophical issues. (shrink)

I argue that we should solve the Lottery Paradox by denying that rational belief is closed under classical logic. To reach this conclusion, I build on my previous result that (a slight variant of) McGee’s election scenario is a lottery scenario (see Lissia 2019). Indeed, this result implies that the sensible ways to deal with McGee’s scenario are the same as the sensible ways to deal with the lottery scenario: we should either reject the Lockean Thesis or Belief Closure. After (...) recalling my argument to this conclusion, I demonstrate that a McGee-like example (which is just, in fact, Carroll’s barbershop paradox) can be provided in which the Lockean Thesis plays no role: this proves that denying Belief Closure is the right way to deal with both McGee’s scenario and the Lottery Paradox. A straightforward consequence of my approach is that Carroll’s puzzle is solved, too. (shrink)

Conditional probability is often used to represent the probability of the conditional. However, triviality results suggest that the thesis that the probability of the conditional always equals conditional probability leads to untenable conclusions. In this paper, I offer an interpretation of this thesis in a possible worlds framework, arguing that the triviality results make assumptions at odds with the use of conditional probability. I argue that these assumptions come from a theory called the operator theory and that the rival restrictor (...) theory can avoid these problematic assumptions. In doing so, I argue that recent extensions of the triviality arguments to restrictor conditionals fail, making assumptions which are only justified on the operator theory. (shrink)

The surprise exam paradox is an apparently sound argument to the apparently absurd conclusion that a surprise exam cannot be given within a finite exam period. A closer look at the logic of the paradox shows the argument breaking down immediately. So why do the beginning stages of the argument appear sound in the first place? This paper presents an account of the paradox on which its allure is rooted in a common probabilistic mistake: the base rate fallacy. The account (...) predicts that the paradoxical argument should get less and less convincing as it goes along—a prediction I take to be welcome. On a bleaker note, the account suggests that the base rate fallacy may be more widespread than previously thought. (shrink)

A spectre haunts the semantics of natural language — the spectre of Triviality. Semanticists (in particular Rothschild 2013; Khoo and Mandelkern 2018a,b) have entered into a holy alliance to exorcise this spectre. None, I will argue, have yet succeeded.