This paper argues that several leading theories of subjunctive conditionals are incompatible with ordinary intuitions about what credences we ought to have in subjunctive conditionals. In short, our theory of subjunctives should intuitively display semantic humility, i.e. our semantic theory should deliver the truth conditions of sentences without pronouncing on whether those conditions actually obtain. In addition to describing intuitions about subjunctive conditionals, I argue that we can derive these ordinary intuitions from justified premises, and I answer a possible worry (...) for my derivation by refuting a subjunctive triviality result modeled on (Lewis 1976). I conclude that the debate over the correct theory of subjunctive conditionals requires settling meta-philosophical questions about the relative value of various virtues of first-order theories of subjunctive conditionals. (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)

Intuition says that choosing to create a miserable person is wrong, but choosing not to create a happy one is not; this is ‘the Asymmetry’. There is a complete theory which agrees – the ‘Harm Minimization’ theory. A well-known objection is that this theory rejects Parfit’s principle of ‘No Difference’. But No Difference has less intuitive support than the Asymmetry, and there seems to be no complete theory which agrees with both. There is, however, a more serious problem for Harm (...) Minimization: it says it is wrong to create happy people if we could have made some of them happier at the expense of others. The purpose of this note is to describe a complete theory which agrees with the Asymmetry and avoids this unacceptable consequence; like Harm Minimization, it rejects No Difference. (shrink)

This paper concerns a controversy between two compelling and popular claims in the theory of ability. One is the claim that ability requires control. The other is the claim that success entails ability, that is, that φ-ing entails that you are able to φ. Since actually φ-ing obviously does not entail that φ is in your control, these two claims cannot both be true. I introduce a new form of evidence to help adjudicate this controversy: judgments about the possibility and (...) probability of ability ascriptions. I argue that these judgments provide evidence in favor of the thesis that success entails ability, and against the thesis that ability requires control. Moreover, I argue that these judgments support an analysis of ability in terms of conditionals. (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.

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)

This paper discusses and relates two puzzles for indicative conditionals: a puzzle about indeterminacy and a puzzle about triviality. Both puzzles arise because of Ramsey's Observation, which states that the probability of a conditional is equal to the conditional probability of its consequent given its antecedent. The puzzle of indeterminacy is the problem of reconciling this fact about conditionals with the fact that they seem to lack truth values at worlds where their antecedents are false. The puzzle of triviality is (...) the problem of reconciling Ramsey's Observation with various triviality proofs which establish that Ramsey's Observation cannot hold in full generality. In the paper, I argue for a solution to the indeterminacy puzzle and then apply the resulting theory to the triviality puzzle. On the theory I defend, the truth conditions of indicative conditionals are highly context dependent and such that an indicative conditional may be indeterminate in truth value at each possible world throughout some region of logical space and yet still have a nonzero probability throughout that region. (shrink)

The rise of causality and the attendant graph-theoretic modeling tools in the study of counterfactual reasoning has had resounding effects in many areas of cognitive science, but it has thus far not permeated the mainstream in linguistic theory to a comparable degree. In this study I show that a version of the predominant framework for the formal semantic analysis of conditionals, Kratzer-style premise semantics, allows for a straightforward implementation of the crucial ideas and insights of Pearl-style causal networks. I spell (...) out the details of such an implementation, focusing especially on the notions of intervention on a network and backtracking interpretations of counterfactuals. (shrink)

The fact that the standard probabilistic calculus does not define probabilities for sentences with embedded conditionals is a fundamental problem for the probabilistic theory of conditionals. Several authors have explored ways to assign probabilities to such sentences, but those proposals have come under criticism for making counterintuitive predictions. This paper examines the source of the problematic predictions and proposes an amendment which corrects them in a principled way. The account brings intuitions about counterfactual conditionals to bear on the interpretation of (...) indicatives and relies on the notion of causal (in)dependence. (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)

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 paper addresses a puzzle about the probabilistic evaluation of counterfactuals, raised by Ernest Adams as a problem for his own theory. I discuss Brian Skyrms’s response to the puzzle. I compare this puzzle with other puzzles about counterfactuals that have arisen more recently. And I attempt to solve the puzzle in a way that is consistent with Adams’s proposal about counterfactuals.

According to so-called epistemic theories of conditionals, the assertability/acceptability/acceptance of a conditional requires the existence of an epistemically significant relation between the conditional’s antecedent and its consequent. This paper points to some linguistic data that our current best theories of the foregoing type appear unable to explain. Further, it presents a new theory of the same type that does not have that shortcoming. The theory is then defended against some seemingly obvious objections.

Bradley has argued that a truth-conditional semantics for conditionals is incompatible with an allegedly very weak and intuitively compelling constraint on the interpretation of conditionals. I argue that the example Bradley offers to motivate this constraint can be explained along pragmatic lines that are compatible with the correctness of at least one popular truth-conditional semantics for conditionals.

Kaufmann has recently argued that the thesis according to which the probability of an indicative conditional equals the conditional probability of the consequent given the antecedent under certain specifiable circumstances deviates from intuition. He presents a method for calculating the probability of a conditional that does seem to give the intuitively correct result under those circumstances. However, the present paper shows that Kaufmann’s method is inconsistent in that it may lead one to assign different probabilities to a single conditional at (...) the same time. (shrink)

Recent work on the interpretation of counterfactual conditionals has paid much attention to the role of causal independencies. One influential idea from the theory of Causal Bayesian Networks is that counterfactual assumptions are made by intervention on variables, leaving all of their causal non-descendants unaffected. But intervention is not applicable across the board. For instance, backtracking counterfactuals, which involve reasoning from effects to causes, cannot proceed by intervention in the strict sense, for otherwise they would be equivalent to their consequents. (...) We discuss these and similar cases, focusing on two factors which play a role in determining whether and which causal parents of the manipulated variable are affected: Speakers' need for an explanation of the hypothesized state of affairs, and differences in the ‘resilience’ of beliefs that are independent of degrees of certainty. We describe the relevant theoretical notions in some detail and provide experimental evidence that these factors do indeed affect speakers' interpretation of counterfactuals. (shrink)

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)

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.

Statements about the future are central in everyday conversation and reasoning. How should we understand their meaning? The received view among philosophers treats will as a tense: in ‘Cynthia will pass her exam’, will shifts the reference time forward. Linguists, however, have produced substantial evidence for the view that will is a modal, on a par with must and would. The different accounts are designed to satisfy different theoretical constraints, apparently pulling in opposite directions. We show that these constraints are (...) jointly satisfied by a novel modal account of will. On this account, will is a modal but doesn't work as a quantifier over worlds. Rather, the meaning of will involves a selection function similar to the one used by Stalnaker in his semantics for conditionals. The resulting theory yields a plausible semantics and logic for will and vindicates our intuitive views about the attitudes that rational agents should have towards future-directed contents. (shrink)

This paper calls for a re-appraisal of McGee's analysis of the semantics, logic and probabilities of indicative conditionals presented in his 1989 paper Conditional probabilities and compounds of conditionals. The probabilistic measures introduced by McGee are given a new axiomatisation built on the principle that the antecedent of a conditional is probabilistically independent of the conditional and a more transparent method of constructing such measures is provided. McGee's Dutch book argument is restructured to more clearly reveal that it introduces a (...) novel contribution to the epistemology of semantic indeterminacy, and shows that its more controversial implications are unavoidable if we want to maintain the Ramsey Test along with the standard laws of probability. Importantly, it is shown that the counterexamples that have been levelled at McGee's analysis|generating a rather wide consensus that it yields `unintuitive' or `wrong' probabilities for compounds |fail to strike at their intended target; for to honour the intuitions of the counterexamples one must either give up the Ramsey Test or the standard laws of probability. It will be argued that we need to give up neither if we take the counterexamples as further evidence that the indicative conditional sometimes allows for a non-epistemic `causal' interpretation alongside its usual epistemic interpretation. (shrink)

An alleged counterexample to causal decision theory, put forward by Andy Egan, is studied in some detail. It is argued that Egan rejects the evaluation of causal decision theory on the basis of a description of the decision situation that is different from—indeed inconsistent with—the description on which causal decision theory makes its evaluation. So the example is not a counterexample to causal decision theory. Nevertheless, the example shows that causal decision theory can recommend unratifiable acts which presents a problem (...) in the dynamics of intentions. It is argued that we can defuse this problem if we hold that decision theory is a theory of rational decision making rather than a theory of rational acts. It is shown how decisions can have epistemic side-effects that are not mediated by the act and that there are cases where one can only bring oneself to perform the best act by updating by imaging rather than by conditioning. This provides a pragmatic argument for updating by imaging rather than by conditioning in these cases. (shrink)

Vann McGee has proposed a counterexample to the Ramsey Test. In the counterexample, a seemingly trustworthy source has testified that p and that if not-p, then q. If one subsequently learns not-p, then one has reason to doubt the trustworthiness of the source and so, the argument goes, one has reason to doubt the conditional asserted by the source. Since what one learns is that the antecedent of the conditional holds, these doubts are contrary to the Ramsey Test. We argue (...) that the counterexample fails. It rests on a principle of testimonial dependence that is not applicable when a source hedges his or her claims. (shrink)

Less‐than‐certain conditional judgments pose notorious problems for strict analyses of conditionals: across their various incarnations, these analyses have trouble making sense of how conditionals could have non‐trivial probabilities in the first place; minimal constraints on how such probabilities are to be assigned, moreover, lead to results that seem at odds with a strict outlook on the semantics of conditionals, most notably the validity of Conditional Excluded Middle. I demonstrate that a strict analysis can overcome the trouble if couched in a (...) bilateral dynamic setting that properly extends the familiar Ramsey test for accepting conditionals to other iffy attitudes, most importantly the one of rejecting a conditional. The resulting framework accommodates the appeal of Stalnaker's thesis as well as of Conditional Excluded Middle in a strict setting. A discussion of how to handle the probability of epistemically modalized conditionals and of compounds of conditionals is provided. (shrink)

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 present a puzzle about knowledge, probability and conditionals. We show that in certain cases some basic and plausible principles governing our reasoning come into conflict. In particular, we show that there is a simple argument that a person may be in a position to know a conditional the consequent of which has a low probability conditional on its antecedent, contra Adams’ Thesis. We suggest that the puzzle motivates a very strong restriction on the inference of a conditional from a (...) disjunction. (shrink)

Disagreement is a hot topic in epistemology. A fast-growing literature centers around a dispute between the ‘steadfast’ view, on which one may maintain one’s beliefs even in the light of disagreement with epistemic peers who have all the same evidence, and the ‘conciliationist’ view, on which such disagreement requires a revision of attitudes. In this paper, however, I argue that there is less separating the main rivals in the debate about peer disagreement than is commonly thought. The extreme versions of (...) both views are clearly indefensible, while more moderate versions of the views converge on the idea that how much revision of belief is called for by an instance of peer disagreement varies from case to case. Those tempted by this diagnosis are sometimes pessimistic about the prospects for giving a unified account which clearly predicts when more or less extensive revisions will be called for. By contrast, in this paper I give an account that aspires to such unity and predictive power, centering on the notion of the net resilience of your estimate of your own reliability against your estimate of your interlocutor’s reliability. The view I present thus amounts to a new, moderate theory of how one should respond to disagreement. I argue that ultimately, when we weaken conciliationism and the steadfast view to account for exception cases and to make them adequately plausible, they end up converging on the moderate view I present. Much of the seeming disagreement about disagreement is, then, illusory. (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)

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)

Holmes exists is false. How can this be, when there is no one for the sentence to misdescribe? Part of the answer is that a sentence’s topic depends on context. The king of France is bald, normally unevaluable, is false qua description of the bald people. Likewise Holmes exists is false qua description of the things that exist; it misdescribes those things as having Holmes among them. This does not explain, though, how Holmes does not exist differs in cognitive content (...) from, say, Vulcan does not exist. Our answer builds on an observation of Kripke’s: even if Holmes exists, he is not in this room, for we were all born too late. (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)

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 few purported counterexamples to the Adams thesis have cropped up in the literature in the last few decades. I propose a theory that accounts for them, in a way that makes the connections between indicative conditionals and counterfactuals clearer.

Discusses how to capture the link between the probability of indicative conditionals and conditional probability using a classical semantics for conditionals.

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)

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)

I present some counterexamples to Adams's Thesis and explain how they undermine arguments that indicative conditionals cannot be truth-evaluable propositions.

This paper presents a general-purpose update semantics for expressions of subjective uncertainty in natural language. First, a set of desiderata are established for how expressions of subjective uncertainty should behave in dynamic, update-based semantic systems; then extant implementations of expressions of subjective uncertainty in such models are evaluated and found wanting; finally, a new update semantics is proposed. The desiderata at the heart of this paper center around the contention that expressions of subjective uncertainty express beliefs which are not persistent, (...) whereas propositions express beliefs that are persistent. I argue that if we make the move of treating updates in a dynamic semantics as Bayesian updates, i.e. as conditionalization, then expressions of subjective uncertainty will behave the way we want them to without altering the way propositions behave. (shrink)

Barristers in England are obliged to follow the ‘cab rank rule’, according to which they must take any case offered to them, as long as they have time in their.

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)