In this paper I draw attention to a peculiar epistemic feature exhibited by certain deductively valid inferences. Certain deductively valid inferences are unable to enhance the reliability of one's belief that the conclusion is true—in a sense that will be fully explained. As I shall show, this feature is demonstrably present in certain philosophically significant inferences—such as GE Moore's notorious 'proof' of the existence of the external world. I suggest that this peculiar epistemic feature might be correlated with the much (...) discussed phenomenon that Crispin Wright and Martin Davies have called 'transmission failure'—the apparent failure, on the part of some deductively valid inferences to transmit one's justification for believing the premises. (shrink)

This is part A of a paper in which we defend a semantics for counterfactuals which is probabilistic in the sense that the truth condition for counterfactuals refers to a probability measure. Because of its probabilistic nature, it allows a counterfactual ‘ifAthenB’ to be true even in the presence of relevant ‘Aand notB’-worlds, as long such exceptions are not too widely spread. The semantics is made precise and studied in different versions which are related to each other by representation theorems. (...) Despite its probabilistic nature, we show that the semantics and the resulting system of logic may be regarded as a naturalistically vindicated variant of David Lewis’ truth-conditional semantics and logic of counterfactuals. At the same time, the semantics overlaps in various ways with the non-truth-conditional suppositional theory for conditionals that derives from Ernest Adams’ work. We argue that counterfactuals have two kinds of pragmatic meanings and come attached with two types of degrees of acceptability or belief, one being suppositional, the other one being truth based as determined by our probabilistic semantics; these degrees could not always coincide due to a new triviality result for counterfactuals, and they should not be identified in the light of their different interpretation and pragmatic purpose. However, for plain assertability the difference between them does not matter. Hence, if the suppositional theory of counterfactuals is formulated with sufficient care, our truth-conditional theory of counterfactuals is consistent with it. The results of our investigation are used to assess a claim considered by Hawthorne and Hájek, that is, the thesis that most ordinary counterfactuals are false. (shrink)

Thought experiments invite us to evaluate philosophical theses by making judgements about hypothetical cases. When the judgements and the theses conflict, it is often the latter that are rejected. But what is the nature of the judgements such that they are able to play this role? I answer this question by arguing that typical judgements about thought experiments are in fact judgements of normal counterfactual sufficiency. I begin by focusing on Anna-Sara Malmgren’s defence of the claim that typical judgements about (...) thought experiments are mere possibility judgements. This view is shown to fail for two closely related reasons: it cannot account for the incorrectness of certain misjudgements, and it cannot account for the inconsistency of certain pairs of conflicting judgements. This prompts a reconsideration of Timothy Williamson’s alternative proposal, according to which typical judgements about thought experiments are counterfactual in nature. I show that taking such judgements to concern what would normally hold in instances of the relevant hypothetical scenarios avoids the objections that have been pressed against this kind of view. I then consider some other potential objections, but argue that they provide no grounds for doubt. (shrink)

The method of thought experiments or possible cases is widespread in philosophy and elsewhere. Thought experiments come with variegated theoretical commitments. These commitments are risky. They may turn out to be false or at least controversial. Other things being equal, it seems preferable to do with minimal commitments. I explore exemplary ways of minimising commitments, focusing on modal ones. There is a near-consensus to treat the scenarios considered in thought experiments as metaphysical possibilities. I challenge this consensus. Paradigmatic thought experiments (...) do not have to come with a commitment to metaphysical possibilities. In the first section, I point out difficulties with the prevailing focus on metaphysical possibilities. In the second section, I present alternative formalisations of a paradigmatic thought experiment, the Gettier experiment. Gettier’s words leave open the kind of possibilities under consideration. The standard way of spelling out Gettier’s argument uses metaphysical possibilities. One alternative proposal uses nomological possibilities. A second one uses epistemic possibilities. My modest conclusion: as long as it is not established that a thought experiment requires a commitment to metaphysical modality, one should avoid such a commitment. My preferred way of doing so is to replace the commitment to one particular formalisation by a commitment to a disjunction of alternative formalisations. (shrink)

Questions concerning the epistemological status of computer science are, in this paper, answered from the point of view of the formal verification framework. State space reduction techniques adopted to simplify computational models in model checking are analysed in terms of Aristotelian abstractions and Galilean idealizations characterizing the inquiry of empirical systems. Methodological considerations drawn here are employed to argue in favour of the scientific understanding of computer science as a discipline. Specifically, reduced models gained by Dataion are acknowledged as Aristotelian (...) abstractions that include only data which are sufficient to examine the interested executions. The present study highlights how the need to maximize incompatible properties is at the basis of both Abstraction Refinement, the process of generating a cascade of computational models to achieve a balance between simplicity and informativeness, and the Multiple Model Idealization approach in biology. Finally, fairness constraints, imposed to computational models to allow fair behaviours only, are defined as ceteris paribus conditions under which temporal formulas, formalizing software requirements, acquire the status of law-like statements about the software systems executions. (shrink)

NOTE: This paper is a reworking of some aspects of an earlier paper – ‘What else justification could be’ and also an early draft of chapter 2 of Between Probability and Certainty. I'm leaving it online as it has a couple of citations and there is some material here which didn't make it into the book (and which I may yet try to develop elsewhere). My concern in this paper is with a certain, pervasive picture of epistemic justification. On this (...) picture, acquiring justification for believing something is essentially a matter of minimising one’s risk of error – so one is justified in believing something just in case it is sufficiently likely, given one’s evidence, to be true. This view is motivated by an admittedly natural thought: If we want to be fallibilists about justification then we shouldn’t demand that something be certain – that we completely eliminate error risk – before we can be justified in believing it. But if justification does not require the complete elimination of error risk, then what could it possibly require if not its minimisation? If justification does not require epistemic certainty then what could it possibly require if not epistemic likelihood? When all is said and done, I’m not sure that I can offer satisfactory answers to these questions – but I will attempt to trace out some possible answers here. The alternative picture that I’ll outline makes use of a notion of normalcy that I take to be irreducible to notions of statistical frequency or predominance. (shrink)