Many recent theories of epistemic discourse exploit an informational notion of consequence, i.e. a notion that defines entailment as preservation of support by an information state. This paper investigates how informational consequence fits with probabilistic reasoning. I raise two problems. First, all informational inferences that are not also classical inferences are, intuitively, probabilistically invalid. Second, all these inferences can be exploited, in a systematic way, to generate triviality results. The informational theorist is left with two options, both of them radical: (...) they can either deny that epistemic modal claims have probability at all, or they can move to a nonstandard probability theory. (shrink)

A framework for pragmatic analysis is proposed which treats discourse as a game, with context as a scoreboard organized around the questions under discussion by the interlocutors. The framework is intended to be coordinated with a dynamic compositional semantics. Accordingly, the context of utterance is modeled as a tuple of different types of information, and the questions therein — modeled, as is usual in formal semantics, as alternative sets of propositions — constrain the felicitous flow of discourse. A requirement of (...) Relevance is satisfied by an utterance (whether an assertion, a question or a suggestion) iff it addresses the question under discussion. Finally, it is argued that the prosodic focus of an utterance canonically serves to reflect the question under discussion (at least in English), placing additional constraints on felicity in context. (shrink)

I discuss three observations about backtracking counterfactuals not predicted by existing theories, and then motivate a theory of counterfactuals that does predict them. On my theory, counterfactuals quantify over a suitably restricted set of historical possibilities from some contextually relevant past time. I motivate each feature of the theory relevant to predicting our three observations about backtracking counterfactuals. The paper concludes with replies to three potential objections.

Adams’s Thesis, the claim that the probabilities of indicative conditionals equal the conditional probabilities of their consequents given their antecedents, has proven impossible to accommodate within orthodox possible-world semantics. This essay proposes a modification to the orthodoxy that removes this impossibility. The starting point is a proposal by Jeffrey and Stalnaker that conditionals take semantic values in the unit interval, interpreting these (à la McGee) as their expected truth-values at a world. Their theories imply a false principle, namely, that the (...) probability of a conditional is independent of any proposition inconsistent with its antecedent. But they also point to something important, namely, that our uncertainty about conditionals is not confined to uncertainty about the facts (what the actual world is like) but also expresses uncertainty about the counterfacts (what the world would be like if one or another supposition were true). To capture this observation, this essay proposes that the semantic contents of conditionals be treated as sets of vectors of possible worlds, not singleton worlds, with the coordinates of each specifying the world that is or would be true under the supposition that it represents. The probabilities of truth for conditionals will then depend on the joint probabilities of the facts and counterfacts, the latter in turn depending on the mode of supposition. The implication of this treatment is that the probabilities of conditionals are conditional probabilities whenever the mode of supposition is evidential. (shrink)

This paper extends earlier work by its authors on formal aspects of the processes of contracting a theory to eliminate a proposition and revising a theory to introduce a proposition. In the course of the earlier work, Gardenfors developed general postulates of a more or less equational nature for such processes, whilst Alchourron and Makinson studied the particular case of contraction functions that are maximal, in the sense of yielding a maximal subset of the theory (or alternatively, of one of (...) its axiomatic bases), that fails to imply the proposition being eliminated. In the present paper, the authors study a broader class, including contraction functions that may be less than maximal. Specifically, they investigate "partial meet contraction functions", which are defined to yield the intersection of some nonempty family of maximal subsets of the theory that fail to imply the proposition being eliminated. Basic properties of these functions are established: it is shown in particular that they satisfy the Gardenfors postulates, and moreover that they are sufficiently general to provide a representation theorem for those postulates. Some special classes of partial meet contraction functions, notably those that are "relational" and "transitively relational", are studied in detail, and their connections with certain "supplementary postulates" of Gardenfors investigated, with a further representation theorem established. (shrink)

We show in this paper that the AGM postulates are too weak to ensure the rational preservation of conditional beliefs during belief revision, thus permitting improper responses to sequences of observations. We remedy this weakness by proposing four additional postulates, which are sound relative to a qualitative version of probabilistic conditioning. Contrary to the AGM framework, the proposed postulates characterize belief revision as a process which may depend on elements of an epistemic state that are not necessarily captured by a (...) belief set. We also show that a simple modification to the AGM framework can allow belief revision to be a function of epistemic states. We establish a model-based representation theorem which characterizes the proposed postulates and constrains, in turn, the way in which entrenchment orderings may be transformed under iterated belief revision. (shrink)

kind of joke to ask what is the case if the antecedent is false—“And where are the biscuits if I don’t want any?”, “And what’s on PBS if I’m not interested?”, “And who shot Kennedy if that’s not what I’m asking?”. With normal indicative conditionals like.

What we want to be true about ordinary indicative conditionals seems to be more than we can possibly get: there just seems to be no good way to assign truth-conditions to ordinary indicative conditionals. Some take this argument as reason to make our wantings more modest. Others take it to show that indicative conditionals don't have truth-conditions in the first place. But we have overlooked two possibilities for assigning truth-conditions to indicatives. What's more, those possibilities deliver what we want and (...) turn out to be equivalent. CiteULike Connotea Del.icio.us Digg Reddit Technorati What's this? (shrink)

THE INDICATIVE CONDITIONAL. A PROBABILISTIC CRITERION OF SOUNDNESS FOR DEDUCTIVE INFERENCES Our objective in this section is to establish a prima facie case ...

Hawthorne and Magidor's criticisms of the model of presupposition and assertion that I have used and defended are all based on a rejection of some transparency or introspection of assumptions about speaker presupposition. This response to those criticisms aims first to clarify, and then to defend, the required transparency assumptions. It is argued, first, that if the assumptions are properly understood, some prima facie problems for them do not apply, second, that rejecting the assumptions has intuitively implausible consequences, and third, (...) that the 'margin of error' argument against the principle of positive introspection has a false premiss. The paper concludes with a response to a criticism of what Hawthorne and Magidor call 'the uniformity principle' that is used in the model to explain some pragmatic phenomena. (shrink)

This article begins by outlining some of the history—beginning with brief remarks of Quine's—of work on conditional assertions and conditional events. The upshot of the historical narrative is that diverse works from various starting points have circled around a nexus of ideas without convincingly tying them together. Section 3 shows how ideas contained in a neglected article of de Finetti's lead to a unified treatment of the topics based on the identification of conditional events as the objects of conditional bets. (...) The penultimate section explores some of the consequences of the resulting logic of conditional events while the last defends it. (shrink)

Classic work by one of the most brilliant figures in post-war analytic philosophy.

According to the Ramsey Test hypothesis the conditional claim that if A then B is credible just in case it is credible that B, on the supposition that A. If true the hypothesis helps explain the way in which we evaluate and use ordinary language conditionals. But impossibility results for the Ramsey Test hypothesis in its various forms suggest that it is untenable. In this paper, I argue that these results do not in fact have this implication, on the grounds (...) that similar results can be proved without recourse to the Ramsey test hypothesis. Instead they show that a number of well entrenched principles of rational belief and belief revision do not apply to conditionals. (shrink)

Why are some conditionals subjunctive? It is often assumed that at least one crucial difference is that subjunctive conditionals presuppose that their antecedent is false, that they are counterfactual (Lakoff 1970). The traditional theory has apparently been refuted. Perhaps the clearest counter-example is one given by Alan Anderson (1951: 37): If Jones had taken arsenic, he would have shown just exactly those symptoms which he does in fact show. A typical place to use such a subjunctive conditional would be in (...) the course of an argument that tries to bolster the hypothesis that Jones did in fact take arsenic. But then it would of course be self-defeating to presuppose that the hypothesis is false. Thus, something else must be going on. (shrink)

Quantified NPs in questions may lead to an interpretation in which the NP quantifies into the question. Which dish did every guest bring? can be understood as: 'For every guest x: which dish did x bring?'. After a review of previous approaches that tried to capture this quantification formally or to explain it away, it is argued that such readings involve quantification into speech acts. As the algebra of speech acts is more limited than a Boolean algebra – it only (...) contains conjunction, not disjunction or negation – it is predicted that only universal quantifiers can scope out of questions or other speech acts. The approach is extended to indirect questions, which either are embedded speech acts or coerced to denote the true answers, depending on the embedding verb; in the latter case a Boolean structure results, and we find wide-scope readings of non-universal quantifiers. (shrink)

A conditional takes the form ‘If A, then C’. On the truth-conditional view of conditionals, conditional statements state things with truth-conditions. On the suppositional view, conditional statements involve the expression of a supposition. I develop and defend a view on which conditional statements both state things with truth-conditions and express suppositions. On this view, something is fundamentally right about standard truth-conditional and standard suppositional views. Considerations in favor of conditional contents lead us to attribute truth-conditional contents to conditional statements; considerations (...) in favor of the suppositional view then lead us to an unexpected account of these contents. The resulting view has a number of benefits, including a unified treatment of conditional speech acts, a plausible account of our practice of ascribing truth-values to conditional statements, a simple explanation of the apparent equivalence between probabilities of conditionals and conditional probabilities, an intuitive treatment of ‘Gibbardian stand-offs’, a plausible logic of conditionals, and an explanation of why theorizing about conditionals has proved so difficult. (shrink)