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.

It is often claimed that credences are not reducible to ordinary beliefs about probabilities. Such a reduction appears to be decisively ruled out by certain sorts of triviality results–analogous to those often discussed in the literature on conditionals. I show why these results do not, in fact, rule out the view. They merely give us a constraint on what such a reduction could look like. In particular they show that there is no single proposition belief in which suffices for having (...) a particular credence, regardless of one’s evidence. But if we allow such propositions to vary with evidence–as we should–then the results do not rule out a reduction. So, at least on this count, credences might very well just be beliefs about probabilities. (shrink)

The chapter is devoted to the probability and acceptability of indicative conditionals. Focusing on three influential theses, the Equation, Adams’ thesis, and the qualitative version of Adams’ thesis, Sikorski argues that none of them is well supported by the available empirical evidence. In the most controversial case of the Equation, the results of many studies which support it are, at least to some degree, undermined by some recent experimental findings. Sikorski discusses the Ramsey Test, and Lewis’s triviality proof, with special (...) attention dedicated to the popular ways of blocking it. Sikorski concludes that the role of the three theses in future studies of conditionals should be re-thought, and he presents alternative proposals. (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)

The epistemic thesis is the thesis that a 'might' counterfactual like 'If Matt had gone to the parade, David might have gone to the parade' has the same meaning as 'Maybe, if Matt had gone to the parade, David would have gone to the parade.' I offer a new theory of the counterfactual interpretation of the modal 'might' on which 'might' has the same meaning as 'maybe would'. And I show that, when coupled with a plausible semantics for 'if' clauses, (...) my theory validates the epistemic thesis. (shrink)

The classic formulation of causal decision theory (CDT) appeals to counterfactuals. It says that you should aim to choose an option that would have a good outcome, were you to choose it. However, this version of CDT faces trouble if the laws of nature are deterministic. After all, the standard theory of counterfactuals says that, if the laws are deterministic, then if anything—including the choice you make—were different in the present, either the laws would be violated or the distant past (...) would be changed. And as several authors have shown, it's easy to transform this upshot of the standard theory of counterfactuals into full-blown counterexamples to CDT. In response to these counterexamples, I argue here that the problem lies, not so much with CDT's guiding idea—that it's the expected causal consequences of your actions that matter for rational decision-making—but with the fact that the classic formulation of CDT doesn't pay sufficient attention to the context-sensitivity of counterfactuals. I develop a contextualist version of CDT which better accounts for this context-sensitivity. And I show that my theory avoids the problems faced by the classic formulation of CDT in determinstic worlds. (shrink)

This paper defends a counterexample to Modus Tollens, and uses it to draw some conclusions about the logic and semantics of indicative conditionals and probability operators in natural language. Along the way we investigate some of the interactions of these expressions with 'knows', and we call into question the thesis that all knowledge ascriptions have truth-conditions.

According to the PCCP thesis, the probability of a conditional A → C is the conditional probability P. This claim is undermined by Lewis’ triviality results, which purport to show that apart from trivial cases, PCCP is not true. In the present article we show that the only rational, “Dutch Book-resistant” extension of the agent’s beliefs concerning non-conditional sentences A and C to the conditional A → C is by assuming that P = P. In other cases a diachronic Dutch (...) Book against the agent can be constructed. There is a tension between our findings and Lewis’ results, which needs to be explained. Therefore, we present a probability space which corresponds in a natural way to the diachronic Dutch Book—and which allows the conditional A → C to be interpreted as an event in a mathematically sound way. It also allows to formalize the notion of conditionalizing A → C on ¬C which plays a crucial role in Lewis’ proof. Our conclusion is that Lewis’ proof is circular, so it cannot be considered to be a sound argument against PCCP. (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)

One of central problems in the theory of conditionals is the construction of a probability space, where conditionals can be interpreted as events and assigned probabilities. The problem has been given a technical formulation by van Fraassen (23), who also discussed in great detail the solution in the form of Stalnaker Bernoulli spaces. These spaces are very complex – they have the cardinality of the continuum, even if the language is finite. A natural question is, therefore, whether a technically simpler (...) (in particular finite) partial construction can be given. In the paper we provide a new solution to the problem. We show how to construct a finite probability space $$\mathrm {S}^\#=\left(\mathrm\Omega^\#,\mathrm\Sigma^\#,\mathrm P^\#\right)$$ S # = Ω #, Σ #, P # in which simple conditionals and their Boolean combinations can be interpreted. The structure is minimal in terms of cardinality within a certain, naturally defined class of models – an interesting side-effect is an estimate of the number of non-equivalent propositions in the conditional language. We demand that the structure satisfy certain natural assumptions concerning the logic and semantics of conditionals and also that it satisfy PCCP. The construction can be easily iterated, producing interpretations for conditionals of arbitrary complexity. (shrink)

We define a semantics for conditionals in terms of stochastic graphs which gives a straightforward and simple method of evaluating the probabilities of conditionals. It seems to be a good and useful method in the cases already discussed in the literature, and it can easily be extended to cover more complex situations. In particular, it allows us to describe several possible interpretations of the conditional and to formalize some intuitively valid but formally incorrect considerations concerning the probabilities of conditionals under (...) these two interpretations. It also yields a powerful method of handling more complex issues. The stochastic graph semantics provides a satisfactory answer to Lewis’s arguments against the PC = CP principle, and defends important intuitions which connect the notion of probability of a conditional with the notion of conditional probability. It also illustrates the general problem of finding formal explications of philosophically important notions and applying mathematical methods in analyzing philosophical issues. (shrink)

We show how to extend any finite probability space into another finite one which satisfies the conditional construal of conditional probability for the original propositions, given some maximal allowed degree of nesting of the conditional. This mitigates the force of the well-known triviality results.

InSuppose and Tell, Williamson makes a new and original attempt to defend the material conditional account of indicative conditionals. His overarching argument is that this account offers the best explanation of the data concerning how people evaluate and use such conditionals. We argue that Williamson overlooks several important alternative explanations, some of which appear to explain the relevant data at least as well as, or even better than, the material conditional account does. Along the way, we also show that Williamson (...) errs at important junctures about what exactly the relevant data are. (shrink)

The Ramsey Test is considered to be the default test for the acceptability of indicative conditionals. I will argue that it is incompatible with some of the recent developments in conceptualizing conditionals, namely the growing empirical evidence for the _Relevance Hypothesis_. According to the hypothesis, one of the necessary conditions of acceptability for an indicative conditional is its antecedent being positively probabilistically relevant for the consequent. The source of the idea is _Evidential Support Theory_ presented in Douven (2008). I will (...) defend the hypothesis against alleged counterexamples, and show that it is supported by growing empirical evidence. Finally, I will present a version of the Ramsey test which incorporates the relevance condition and therefore is consistent with growing empirical evidence for the relevance hypothesis. (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)

Stalnaker's Thesis about indicative conditionals is, roughly, that the probability one ought to assign to an indicative conditional equals the probability that one ought to assign to its consequent conditional on its antecedent. The thesis seems right. If you draw a card from a standard 52-card deck, how confident are you that the card is a diamond if it's a red card? To answer this, you calculate the proportion of red cards that are diamonds -- that is, you calculate the (...) probability of drawing a diamond conditional on drawing a red card. Skyrms' Thesis about counterfactual conditionals is, roughly, that the probability that one ought to assign to a counterfactual equals one's rational expectation of the chance, at a relevant past time, of its consequent conditional on its antecedent. This thesis also seems right. If you decide not to enter a 100-ticket lottery, how confident are you that you would have won had you bought a ticket? To answer this, you calculate the prior chance--that is, the chance just before your decision not to buy a ticket---of winning conditional on entering the lottery. The central project of this article is to develop a new uniform theory of conditionals that allows us to derive a version of Skyrms' Thesis from a version of Stalnaker's Thesis, together with a chance-deference norm relating rational credence to beliefs about objective chance. (shrink)

The pattern of credences we are inclined to assign to counterfactuals challenges standard accounts of counterfactuals. In response to this problem, the paper develops a semantics of counterfactuals in terms of the epsilon-operator. The proposed semantics stays close to the standard account: the epsilon-operator substitutes the universal quantifier present in standard semantics by arbitrarily binding the open world-variable. Various applications of the suggested semantics are explored including, in particular, an explanation of how the puzzling credences in counterfactuals come about.

The literature on indicative conditionals contains two appealing views. The first is the selectional view: on this view, conditionals operate by selecting a single possibility, which is used to evaluate the consequent. The second is the informational view: on this view, conditionals don’t express propositions, but rather impose constraints on information states of speakers. Both views are supported by strong arguments, but they are incompatible on their standard formulations. Hence it appears that we have to choose between mutually exclusive options. (...) But the options are not exclusive. This paper develops a theory of the semantics and assertability of conditionals that is both selectional and informational. The theory vindicates the signature inferences of both selectional and informational theories, including so-called Conditionals Excluded Middle and principles about the interplay between conditionals and ‘might’. It also predicts some interesting and puzzling facts about the assertion of conditionals. (shrink)

On an influential line of thinking tracing back to Ramsey, conditionals are closely linked to the attitude of supposition. When applied to counterfactuals, this view suggests a subjunctive version of the so-called Ramsey test: the probability of a counterfactual If A, would B ought to be equivalent to the probability of B, under the subjunctive supposition that A. I present a collapse result for any view that endorses the subjunctive version of the Ramsey test. Starting from plausible assumptions, the result (...) shows that one’s rational credence in a would-counterfactual and in the corresponding might-counterfactual have to be identical. (shrink)

Famous results by David Lewis show that plausible-sounding constraints on the probabilities of conditionals or evaluative claims lead to unacceptable results, by standard probabilistic reasoning. Existing presentations of these results rely on stronger assumptions than they really need. When we strip these arguments down to a minimal core, we can see both how certain replies miss the mark, and also how to devise parallel arguments for other domains, including epistemic “might,” probability claims, claims about comparative value, and so on. A (...) popular reply to Lewis's results is to claim that conditional claims, or claims about subjective value, lack truth conditions. For this strategy to have a chance of success, it needs to give up basic structural principles about how epistemic states can be updated—in a way that is strikingly parallel to the commitments of the project of dynamic semantics. (shrink)

I formulate a counterfactual version of the notorious ‘Ramsey Test’. Whereas the Ramsey Test for indicative conditionals links credence in indicatives to conditional credences, the counterfactual version links credence in counterfactuals to expected conditional chance. I outline two forms: a Ramsey Identity on which the probability of the conditional should be identical to the corresponding conditional probability/expectation of chance; and a Ramsey Bound on which credence in the conditional should never exceed the latter. Even in the weaker, bound, form, the (...) counterfactual Ramsey Test makes counterfactuals subject to the very argument that Lewis used to argue against the indicative version of the Ramsey Test. I compare the assumptions needed to run each, pointing to assumptions about the time‐evolution of chances that can replace the appeal to Bayesian assumptions about credence update in motivating the assumptions of the argument. I finish by outlining two reactions to the discussion: to indicativize the debate on counterfactuals; or to counterfactualize the debate on indicatives. (shrink)

According to Stalnaker’s Thesis, the probability of a conditional is the conditional probability. Under some mild conditions, the thesis trivialises probabilities and conditionals, as initially shown by David Lewis. This article asks the following question: does still lead to triviality, if the probability function in is replaced by a probability-like function? The article considers plausibility functions, in the sense of Friedman and Halpern, which additionally mimic probabilistic additivity and conditionalisation. These quasi probabilities comprise Friedman–Halpern’s conditional plausibility spaces, as well as (...) other known representations of conditional doxastic states. The paper proves Lewis’ triviality for quasi probabilities and discusses how this has implications for three other prominent strategies to avoid Lewis’ triviality: Adams’ thesis, where the probability function on the left in is replaced by a probability-like function, abandoning conditionalisation, where probability conditionalisation on the right in is replaced by another propositional update procedure and the approximation thesis, where equality in is replaced by approximation. The paper also shows that Lewis’ triviality result is really about ‘additiveness’ and ‘conditionality’. (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)

One very popular kind of semantics for subjunctive conditionals is aclosest-worlds account along the lines of theories given by David Lewisand Robert Stalnaker. If we could give the same sort of semantics forindicative conditionals, we would have a more unified account of themeaning of ``if ... then ...'' statements, one with manyadvantages for explaining the behaviour of conditional sentences. Such atreatment of indicative conditionals, however, has faced a battery ofobjections. This paper outlines a closest-worlds account of indicativeconditionals that does better (...) than some of its cousins in explaining thebehaviour of such conditionals. The paper then discusses objectionsoffered by Dorothy Edgington and Frank Jackson to closest-worldsaccounts of indicative conditionals, and shows that these objections canbe met by the account outlined. (shrink)

Chancy modus ponens is the following inference scheme: ‘probably φ’, ‘if φ, then ψ’, therefore, ‘probably ψ’. I argue that Chancy modus ponens is invalid in general. I further argue that the invalidity of Chancy modus ponens sheds new light on the alleged counterexample to modus ponens presented by McGee. I close by observing that, although Chancy modus ponens is invalid in general, we can recover a restricted sense in which this scheme of inference is valid.

We show that the implicational fragment of intuitionism is the weakest logic with a non-trivial probabilistic semantics which satisfies the thesis that the probabilities of conditionals are conditional probabilities. We also show that several logics between intuitionism and classical logic also admit non-trivial probability functions which satisfy that thesis. On the other hand, we also prove that very weak assumptions concerning negation added to the core probability conditions with the restriction that probabilities of conditionals are conditional probabilities are sufficient to (...) trivialize the semantics. (shrink)

In this paper we examine the thesis that the probability of the conditional is the conditional probability. Previous work by a number of authors has shown that in standard numerical probability theories, the addition of the thesis leads to triviality. We introduce very weak, comparative conditional probability structures and discuss some extremely simple constraints. We show that even in such a minimal context, if one adds the thesis that the probability of a conditional is the conditional probability, then one trivializes (...) the theory. Another way of stating the result is that the conditional of conditional probability cannot be represented in the object language on pain of trivializing the theory. (shrink)

I explore the logic of the conditional, using credence judgments to argue against Duality and in favor of Conditional Excluded Middle. I then explore how to give a theory of the conditional which validates the latter and not the former, developing a variant on Kratzer (1981)'s restrictor theory, as well as a proposal which combines Stalnaker (1968)'s theory of the conditional with the theory of epistemic modals I develop in Mandelkern 2019a. I argue that the latter approach fits naturally with (...) a conception of conditionals as referential devices which allow us to talk about particular worlds. (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)

Although mathematical philosophy is flourishing today, it remains subject to criticism, especially from non-analytical philosophers. The main concern is that even if formal tools serve to clarify reasoning, they themselves contribute nothing new or relevant to philosophy. We defend mathematical philosophy against such concerns here by appealing to its metaphysical foundations. Our thesis is that mathematical philosophy can be founded on the phenomenological theory of ideas as developed by Roman Ingarden. From this platonist perspective, the “unreasonable effectiveness of mathematics in (...) philosophy”—to adapt Wigner’s phrase—is analogous to that of mathematical explanations in science. As success-criteria for mathematical philosophy, we propose that it should be correct, responsive, illuminating, promising, relevant, and adequate. (shrink)

Inquiry into the meaning of logical terms in natural language (‘and’, ‘or’, ‘not’, ‘if’) has generally proceeded along two dimensions. On the one hand, semantic theories aim to predict native speaker intuitions about the natural language sentences involving those logical terms. On the other hand, logical theories explore the formal properties of the translations of those terms into formal languages. Sometimes, these two lines of inquiry appear to be in tension: for instance, our best logical investigation into conditional connectives may (...) show that there is no conditional operator that has all the properties native speaker intuitions suggest if has. Indicative conditionals have famously been the source of one such tension, ever since the triviality proofs of both Lewis (1976) and Gibbard (1981) established conclusions which are in prima facie tension with ordinary judgments about natural language indicative conditionals. In a recent series of papers, Branden Fitelson has strengthened both triviality results (Fitelson 2013, 2015, 2016), revealing a common culprit: a logical schema known as IMPORT-EXPORT. Fitelson’s results focus the tension between the logical results and ordinary judgments, since IMPORT-EXPORT seems to be supported by intuitions about natural language. In this paper, we argue that the intuitions which have been taken to support IMPORT-EXPORT are really evidence for a closely related, but subtly different, principle. We show that the two principles are independent by showing how, given a standard assumption about the conditional operator in the formal language in which IMPORT-EXPORT is stated, many existing theories of indicative conditionals validate one, but not the other. Moreover, we argue that once we clearly distinguish these principles, we can use propositional anaphora to show that IMPORT-EXPORT is in fact not valid for natural language indicative conditionals (given this assumption about the formal conditional operator). This gives us a principled and independently motivated way of rejecting a crucial premise in many triviality results, while still making sense of the speaker intuitions which appeared to motivate that premise. We suggest that this strategy has broad application and an important lesson: in theorizing about the logic of natural language, we must pay careful attention to the translation between the formal languages in which logical results are typically proved, and natural languages which are the subject matter of semantic theory. (shrink)

The Ramseyan thesis that the probability of an indicative conditional is equal to the corresponding conditional probability of its consequent given its antecedent is both widely confirmed and subject to attested counterexamples (e.g., McGee 2000, Kaufmann 2004). This raises several puzzling questions. For instance, why are there interpretations of conditionals that violate this Ramseyan thesis in certain contexts, and why are they otherwise very rare? In this paper, I raise some challenges to Stefan Kaufmann's account of why the Ramseyan thesis (...) sometimes fails, and motivate my own theory. On my theory, the proposition expressed by an indicative conditional is partially determined by a background partition, and hence its probability depends on the choice of such a partition. I hold that this background partition is contextually determined, and in certain conditions is set by a salient question under discussion in the context. I show how the resulting theory offers compelling answers to the puzzling questions raised by failures of the Ramseyan thesis. (shrink)

The connection between the probabilities of conditionals and the corresponding conditional probabilities has long been explored in the philosophical literature, but its implementation faces both technical obstacles and objections on empirical grounds. In this paper I ?rst outline the motivation for the probabilistic turn and Lewis’ triviality results, which stand in the way of what would seem to be its most straightforward implementation. I then focus on Richard Jeffrey’s ’random-variable’ approach, which circumvents these problems by giving up the notion that (...) conditionals denote propositions in the usual sense. Even so, however, the random-variable approach makes counterintuitive predictions in simple cases of embedded conditionals. I propose to address this problem by enriching the model with an explicit representation of causal dependencies. The addition of such causal information not only remedies the shortcomings of Jeffrey’s conditional, but also opens up the possibility of a uni?ed probabilistic account of indicative and counterfactual conditionals. (shrink)

Conditionals with conditional constituents pose challenges for _the Thesis_, the idea that the probability of a conditional is the corresponding conditional probability. This note is concerned with two proposals for overcoming those challenges, both inspired by early work of van Fraassen: the _Bernoulli Semantics_ associated with Stalnaker and Jeffrey, and augmented with a mechanism for obtaining “local probabilities” by Kaufmann; and a proposal by Bacon which I dub _Ordinal Semantics_. Despite differences in mathematical details and emphasis of presentation, both proposals (...) lend themselves for use as a basis for a modal-theoretic interpretation of embedded conditionals. The goal of this note is to compare the two frameworks by implementing a model for the interpretation of conditionals in each, based on the same underlying probability model for non-conditional sentences. I show that in the Ordinal model, certain sentences are assigned probabilities that do not accord with intuitions. This problem is familiar from the literature on Bernoulli models and can be addressed by introducing Kaufmann-style local probabilities into Ordinal models. I then show that Bernoulli Semantics has other limitations, in that it assigns probabilities in violation of the Thesis to certain very complex formulas. The upshot is that a fusion of the theories may be our best shot at getting the predictions right. (shrink)

This paper discusses counterexamples to the thesis that the probabilities of conditionals are conditional probabilities. It is argued that the discrepancy is systematic and predictable, and that conditional probabilities are crucially involved in the apparently deviant interpretations. Furthermore, the examples suggest that such conditionals have a less prominent reading on which their probability is in fact the conditional probability, and that the two readings are related by a simple step of abductive inference. Central to the proposal is a distinction between (...) causal and purely stochastic dependence between variables. (shrink)

The thesis that probabilities of conditionals are conditional probabilities has putatively been refuted many times by so-called ‘triviality results’, although it has also enjoyed a number of resurrections. In this paper I assault it yet again with a new such result. I begin by motivating the thesis and discussing some of the philosophical ramifications of its fluctuating fortunes. I will canvas various reasons, old and new, why the thesis seems plausible, and why we should care about its fate. I will (...) look at some objections to Lewis’s famous triviality results, and thus some reasons for the pursuit of further triviality results. I will generalize Lewis’s results in ways that meet the objections. I will conclude with some reflections on the demise of the thesis—or otherwise. (shrink)

‘Probability logic’ might seem like an oxymoron. Logic traditionally concerns matters immutable, necessary and certain, while probability concerns the uncertain, the random, the capricious. Yet our subject has a distinguished pedigree. Ramsey begins his classic “Truth and Probability” with the words: “In this essay the Theory of Probability is taken as a branch of logic. … “speaks of “the logic of the probable.” And more recently, regards probabilities as estimates of truth values, and thus probability theory as a natural outgrowth (...) of two‐valued logic—what he calls “probability logic.” However the point is put, probability theory and logic are clearly intimately related. This chapter explores some of the multifarious connections between probability and logic, and focuses on various philosophical issues in the foundations of probability theory. (shrink)

I formulate a counterfactual version of the notorious 'Ramsey Test'. Whereas the Ramsey Test for indicative conditionals links credence in indicatives to conditional credences, the counterfactual version links credence in counterfactuals to expected conditional chance. I outline two forms: a Ramsey Identity on which the probability of the conditional should be identical to the corresponding conditional probabihty/expectation of chance; and a Ramsey Bound on which credence in the conditional should never exceed the latter.Even in the weaker, bound, form, the counterfactual (...) Ramsey Test makes counterfactuals subject to the very argument that Lewis used to argue against the indicative version of the Ramsey Test. I compare the assumptions needed to run each, pointing to assumptions about the time-evolution of chances that can replace the appeal to Bayesian assumptions about credence update in motivating the assumptions of the argument.I finish by outlining two reactions to the discussion: to indicativize the debate on counterfactuals; or to counterfactualize the debate on indicatives. (shrink)

Adams’ thesis is generally agreed to be linguistically compelling for simple conditionals with factual antecedent and consequent. We propose a derivation of Adams’ thesis from the Lewis- Kratzer analysis of if-clauses as domain restrictors, applied to probability operators. We argue that Lewis’s triviality result may be seen as a result of inexpressibility of the kind familiar in generalized quantifier theory. Some implications of the Lewis- Kratzer analysis are presented concerning the assignment of probabilities to compounds of conditionals.

The most controversial condition that the AGM theory of rational belief change places on belief contraction is the recovery condition. The condition is controversial because of a series of putative counterexamples due (separately) to I. Levi and S. O. Hansson. In this paper we show that the conflicts that Levi and Hansson arrange between AGM contraction and our intuitions about how to give up beliefs are merely apparent. We argue that these conflicts disappear once we attend more closely to the (...) identification of the beliefs contracted away in each counterexample case. Since, on our view, speakers" belief contraction intentions are often more complicated than they may first appear, we are led to develop apparatus for thinking about the communication and identification of those intentions. Our argument refocuses attention on the difficult question of how to apply the AGM theory to particular cases. (shrink)

The most controversial condition that the AGM theory of rational belief change places on belief contraction is the recovery condition. The condition is controversial because of a series of putative counterexamples due (separately) to I. Levi and S. O. Hansson. In this paper we show that the conflicts that Levi and Hansson arrange between AGM contraction and our intuitions about how to give up beliefs are merely apparent. We argue that these conflicts disappear once we attend more closely to the (...) identification of the beliefs contracted away in each counterexample case. Since, on our view, speakers' belief contraction intentions are often more complicated than they may first appear, we are led to develop apparatus for thinking about the communication and identification of those intentions. Our argument refocuses attention on the difficult question of how to apply the AGM theory to particular cases. (shrink)

I argue that the suppositional view of conditionals, which is quite popular for indicative conditionals, extends also to subjunctive or counterfactual conditionals. According to this view, conditional judgements should not be construed as factual, categorical judgements, but as judgements about the consequent under the supposition of the antecedent. The strongest evidence for the view comes from focusing on the fact that conditional judgements are often uncertain; and conditional uncertainty, which is a well-understood notion, does not function like uncertainty about matters (...) of fact. I argue that the evidence for this view is as strong for subjunctives as it is for indicatives. (shrink)

Edgington has proposed a solution to the sorites paradox in terms of ‘verities’, which she defines as degrees of closeness to clear truth. Central to her solution is the assumption that verities are formally probabilities. She is silent on what verities might derive from and on why they should be probabilities. This paper places Edgington’s solution in the framework of a spatial approach to conceptualization, arguing that verities may be conceived of as deriving from how our concepts relate to each (...) other. Building on work by Kamp and Partee, this paper further shows how verities, thus conceived of, may plausibly be assumed to have probabilistic structure. The new interpretation of verities is argued to also help answer the question of what the verities of indicative conditionals are, a question which Edgington leaves open. Finally, the question of how to accommodate higher-order vagueness, given this interpretation, is addressed. (shrink)

According to what is now commonly referred to as “the Equation” in the literature on indicative conditionals, the probability of any indicative conditional equals the probability of its consequent of the conditional given the antecedent of the conditional. Philosophers widely agree in their assessment that the triviality arguments of Lewis and others have conclusively shown the Equation to be tenable only at the expense of the view that indicative conditionals express propositions. This study challenges the correctness of that assessment by (...) presenting data that cast doubt on an assumption underlying all triviality arguments. (shrink)