The problem of probabilities of conditionals is one of the long-standing puzzles in philosophy of language. We defend and update Adams' solution to the puzzle: the probability of an epistemic conditional is not the probability of a proposition, but a probability under a supposition. -/- Close inspection of how a triviality result unfolds in a concrete scenario does not provide counterexamples to the view that probabilities of conditionals are conditional probabilities: instead, it supports the conclusion that probabilities of conditionals violate (...) standard probability theory. -/- This does not call into question probability theory per se; rather, it calls for a more careful understanding of its role: probability theory is a theory of probabilities of propositions; but as conditionals do not express propositions, their probabilities are not subject to the standard laws. -/- We argue that both conditional probabilities and probabilities of conditionals are best understood in terms of the dynamics of supposing, modeled as a restriction operation on a probability space. This version of the suppositionalist view allows us to connect Adams' Thesis to the widely held restrictor view of the semantics of conditionals. -/- We address two common objections to Adams' view: that the relevant probabilities are ‘probabilities only in name’, and that giving up conditional propositions puts us at a disadvantage when it comes to interpreting compounds. -/- Finally, we argue that some putative counterexamples to Adams' Thesis can be diagnosed as fallacies of probabilistic reasoning: they arise from applying to conditionals laws of standard probability theory which are invalid for them. (shrink)

In ‘Sly Pete’ or ‘standoff’ cases, reasonable speakers accept incompatible conditionals, and communicate them successfully to a trusting hearer. This paper uses the framework of dynamic semantics to offer a new model of the conversational dynamics at play in standoffs, and to articulate several puzzles posed by such cases. The paper resolves these puzzles by embracing a dynamic semantics for conditionals, according to which indicative conditionals require that their antecedents are possible in their local context, and update this body of (...) information by eliminating the possibilities where the antecedent is true and the consequent is false. In this way, the dynamic analysis draws on insights from the material conditional and contextualist analyses, while explaining how standoffs are genuine disagreements. (shrink)

I generalize the notion of a conditional attitude by bringing together two topics of inquiry. One is the ordinary inquiry into conditional attitudes. The other topic is the inquiry into the attitude of thinking that a proposition is likely, or having a high credence in a proposition. For instance, what is it to intend to go to the game if it is likely that Kershaw pitches? Being likely that Kershaw pitches is the condition of the attitude. Given a natural position (...) about statements like “It is likely that Kershaw pitches,” the target attitude looks different from ordinary conditional attitudes. (shrink)

The Identity principle says that conditionals with the form 'If p, then p' are logical truths. Identity is overwhelmingly plausible, and has rarely been explicitly challenged. But a wide range of conditionals nonetheless invalidate it. I explain the problem, and argue that the culprit is the principle known as Import-Export, which we must thus reject. I then explore how we can reject Import-Export in a way that still makes sense of the intuitions that support it, arguing that the differences between (...) indicative and subjunctive conditionals play a key role in solving this puzzle. (shrink)

This paper develops a trivalent semantics for the truth conditions and the probability of the natural language indicative conditional. Our framework rests on trivalent truth conditions first proposed by Cooper (1968) and Belnap (1973) and it yields two logics of conditional reasoning: (i) a logic C of certainty-preserving inference; and (ii) a logic U for uncertain reasoning that preserves the probability of the premises. We show systematic correspondences between trivalent and probabilistic representations of inferences in either framework, and we use (...) the distinction between the two systems to cast light on the validity of inferences such as Modus Ponens, Or-To-If, and Conditional Excluded Middle. Specifically, the conditional behaves monotonically in C, but non-monotonically in U; Modus Ponens is valid in C, but valid in U only for non-nested conditionals. The result is a unified account of the semantics and epistemology of indicative conditionals that can be fruitfully applied to analyzing the validity of conditional inferences. (shrink)

We analyze three interesting arguments from the literature, where ascribing a probability of 1 to a certain right-nested conditional A→(B→C) leads to strong theses concerning conditionals: they serve as counterexamples to important general claims. The first is the classic and much discussed McGee’s counterexample to Modus Ponens from McGee [“A Counterexample to Modus Ponens.” The Journal of Philosophy 82 (9): 462–471]. The second example was given by Santorio [“Trivializing Informational Consequence.” Philosophy and Phenomenological Research 104:297–320] and is intended to undermine (...) the probabilistic version of Modus Ponens. The third example was presented in Cantwell [“Revisiting McGee’s Probabilistic Analysis of Conditionals.” Journal of Philosophical Logic 51 (5): 973–1017] in order to reject the general version of the Ramsey Test (i.e. PCCP) and Modus Ponens. These examples are based on a specific interpretation of right-nested conditional which is not the only possible one. We provide examples demonstrating that alternative interpretations are feasible. As a result, the arguments presented in the three cited works possess limited efficacy, as they are confined solely to the particular interpretation of the conditional. (shrink)

This paper explores trivalent truth conditions for indicative conditionals, examining the “defective” truth table proposed by de Finetti and Reichenbach. On their approach, a conditional takes the value of its consequent whenever its antecedent is true, and the value Indeterminate otherwise. Here we deal with the problem of selecting an adequate notion of validity for this conditional. We show that all standard validity schemes based on de Finetti’s table come with some problems, and highlight two ways out of the predicament: (...) one pairs de Finetti’s conditional with validity as the preservation of non-false values, but at the expense of Modus Ponens; the other modifies de Finetti’s table to restore Modus Ponens. In Part I of this paper, we present both alternatives, with specific attention to a variant of de Finetti’s table proposed by Cooper and Cantwell. In Part II, we give an in-depth treatment of the proof theory of the resulting logics, DF/TT and CC/TT: both are connexive logics, but with significantly different algebraic properties. (shrink)

A conversation can be conceived as aiming to circumscribe a set of possibilities that are relevant to the goals of the conversation. This set of possibilities may be conceived as determined by the goals and objective circumstances of the interlocutors and not by their propositional attitudes. An indicative conditional can be conceived as circumscribing a set of possibilities that have a certain property: If the set of relevant possibilities is subsequently restricted to one in which the antecedent holds, then it (...) will be restricted as well to one in which the consequent holds. We will identify a number of desiderata concerning the validity of arguments; we will develop a formally precise semantics for conditionals conceived in this way that satisfies the desiderata, and we will present a deductive calculus that is sound and complete with respect to the semantics. Finally, we will argue that the semantics compares well, both formally and foundationally, with two other semantic theories of indicative conditionals that satisfy the desiderata, namely, those of Gillies and Bledin. (shrink)

I give a semantics for a logic with two pairs of doxastic modals and an indicative conditional connective that all nest without restriction. Sentences are evaluated as accepted, rejected, or neither. Certainty is the necessity-like modality of acceptance. Inferences may proceed from premises that are certain, or merely accepted, or a mix of both. This semantic setup yields some striking results. Notably, the existence of inferences that preserve certainty but not acceptance very directly implies both failure of modus ponens for (...) the indicative conditional in the logic of acceptance and failure of the deduction theorem for the material conditional in the logic of certainty. The latter failure dissolves, in the logic of certainty, the much - discussed tension between modus ponens and the law of import-export. (shrink)

The view that if-clauses function semantically as restrictors is widely regarded as the only candidate for a fully general account of conditionals. The standard implementation of this view assumes that, where no operator to be restricted is in sight, if-clauses restrict covert epistemic modals. Stipulating such modals, however, lacks independent motivation and leads to wrong empirical predictions. In this paper I provide a theory of conditionals on which if-clauses are uniformly interpreted as restrictors, but no covert modals are postulated. Epistemic (...) if-clauses, like those in bare conditionals, restrict an information state parameter which is used to interpret an expressive layer of the language. I show that this theory yields an attractive account of bare and overtly modalized conditionals and solves various empirical problems for the standard view, while dispensing with its less plausible assumption. (shrink)