Moritz Schulz

Three-valued accounts of conditionals frequently promise (a) to conform to the probabilistic view that conditionals are evaluated by conditional probabilities, and (b) to yield a plausible account of compounds of conditionals. However, McGee (1981) shows that probabilistic validity, the conception of validity most naturally associated with the probabilistic view, cannot be characterized by a finite matrix. Adams (1995) indicates a further generalization of this result. Nevertheless, Adams (1986) provides a description of probabilistic validity in three-valued terms by going beyond the standard framework. Yet the language Adams considers is severely restricted: it does not contain compounds of conditionals. Thus, a natural question arises: Is there a plausible three-valued account of compounds of conditionals which agrees with probabilistic validity on the restricted language? In this note, I develop a general framework in which to address this question. The answer will be negative

A paper by Schulz (Philos Stud 149:367–386, 2010) describes how the suppositional view of indicative conditionals can be supplemented with a derived view of epistemic modals. In a recent criticism of this paper, Willer (Philos Stud 153:365–375, 2011) argues that the resulting account of conditionals and epistemic modals cannot do justice to the validity of certain inference patterns involving modalised conditionals. In the present response, I analyse Willer’s argument, identify an implicit presupposition which can plausibly be denied and show that accepting it would blur the difference between plain assumptions and their epistemic necessitations

A possible event always seems to be more probable than an impossible event. Although this constraint, usually alluded to as regularity , is prima facie very attractive, it cannot hold for standard probabilities. Moreover, in a recent paper Timothy Williamson has challenged even the idea that regularity can be integrated into a comparative conception of probability by showing that the standard comparative axioms conflict with certain cases if regularity is assumed. In this note, we suggest that there is a natural weakening of the standard comparative axioms. It is shown that these axioms are consistent both with the regularity condition and with the essential feature of Williamson’s example

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