We reflect on lessons that the lottery and preface paradoxes provide for the logic of uncertain inference. One of these lessons is the unreliability of the rule of conjunction of conclusions in such contexts, whether the inferences are probabilistic or qualitative; this leads us to an examination of consequence relations without that rule, the study of other rules that may nevertheless be satisfied in its absence, and a partial rehabilitation of conjunction as a ‘lossy’ rule. A second lesson is the (...) possibility of rational inconsistent belief; this leads us to formulate criteria for deciding when an inconsistent set of beliefs may reasonably be retained. (shrink)

A conditional takes the form ‘If A, then C’. On the truth-conditional view of conditionals, conditional statements state things with truth-conditions. On the suppositional view, conditional statements involve the expression of a supposition. I develop and defend a view on which conditional statements both state things with truth-conditions and express suppositions. On this view, something is fundamentally right about standard truth-conditional and standard suppositional views. Considerations in favor of conditional contents lead us to attribute truth-conditional contents to conditional statements; considerations (...) in favor of the suppositional view then lead us to an unexpected account of these contents. The resulting view has a number of benefits, including a unified treatment of conditional speech acts, a plausible account of our practice of ascribing truth-values to conditional statements, a simple explanation of the apparent equivalence between probabilities of conditionals and conditional probabilities, an intuitive treatment of ‘Gibbardian stand-offs’, a plausible logic of conditionals, and an explanation of why theorizing about conditionals has proved so difficult. (shrink)

Arguments and conditionals are powerful means language provides us to reason about possibilities and to reach conclusions from premises. These two kinds of constructions exhibit several affinities—e.g., they both come in different varieties depending on the mood; they share some of the same connectives (i.e., ‘then’); they allow for similar patterns of modal subordination. In the light of these affinities, it is not surprising that prominent theories of conditionals—old and new suppositionalisms as well as dynamic theories of conditionals—as well as (...) certain reductive theories of arguments tend to semantically assimilate conditionals and arguments. In this paper, I shall marshall some linguistic evidence as well as some theoretical considerations for thinking that, despite these similarities, arguments and conditionals should be given a different semantics and I shall lay out a framework that can capture at least some of their affinities while accounting for their outstanding differences. (shrink)

Is there an interesting relation between the Preface paradox and the Sorites paradox that might be used to illuminate either or both of those paradoxes and the phenomena of rationality and vagueness with which they, respectively, are bound up? In particular, if we consider the analogy alongside a familiar response to the Preface Paradox that employs degrees of belief, does this give any support to the thought that we should adopt some kind of degree-theoretic treatment of vagueness and the sorites? (...) This chapter argues that it does not; indeed exploring the disanalogies contributes to a case against such a treatment of vagueness more generally. Among other views, it considers Edgington’s account of vagueness that employs a probabilistic structure of “verities”. It then contends that appeal to the framework of supervaluationism yields a better guide to reasoning in vague language than the degree-theoretic treatment can sustain. (shrink)

Timothy Williamson has defended the claim that the semantics of the indicative ‘if’ is given by the material conditional. Putative counterexamples can be handled by better understanding the role played in our assessment of indicatives by a fallible cognitive heuristic, called the Suppositional Procedure. Williamson’s Suppositional Conjecture has it that the Suppositional Procedure is humans’ primary way of prospectively assessing conditionals. This paper raises some doubts on the Suppositional Procedure and Conjecture.

Once upon a time, some thought that indicative conditionals could be effectively analyzed as material conditionals. Later on, an alternative theoretical construct has prevailed and received wide acceptance, namely, the conditional probability of the consequent given the antecedent. Partly following critical remarks recently ap- peared in the literature, we suggest that evidential support—rather than conditional probability alone—is key to understand indicative conditionals. There have been motivated concerns that a theory of evidential conditionals (unlike their more tra- ditional counterparts) cannot generate (...) a sufficiently interesting logical system. Here, we will describe results dispelling these worries. Happily, and perhaps surprisingly, appropriate technical variations of Ernst Adams’s classical approach allow for the construction of a logic of evidential conditionals with distinctive fea- tures, which is also well-behaved and reasonably strong. (shrink)

We propose a new account of indicative conditionals, giving acceptability and logical closure conditions for them. We start from Adams’ Thesis: the claim that the acceptability of a simple indicative equals the corresponding conditional probability. The Thesis is widely endorsed, but arguably false and refuted by empirical research. To fix it, we submit, we need a relevance constraint: we accept a simple conditional 'If φ, then ψ' to the extent that (i) the conditional probability p(ψ|φ) is high, provided that (ii) (...) φ is relevant for ψ. How (i) should work is well-understood. It is (ii) that holds the key to improve our understanding of conditionals. Our account has (i) a probabilistic component, using Popper functions; (ii) a relevance component, given via an algebraic structure of topics or subject matters. We present a probabilistic logic for simple indicatives, and argue that its (in)validities are both theoretically desirable and in line with empirical results on how people reason with conditionals. (shrink)

This paper develops a probabilistic analysis of conditionals which hinges on a quantitative measure of evidential support. In order to spell out the interpreta- tion of ‘if’ suggested, we will compare it with two more familiar interpretations, the suppositional interpretation and the strict interpretation, within a formal framework which rests on fairly uncontroversial assumptions. As it will emerge, each of the three interpretations considered exhibits specific logical features that deserve separate consideration.

The purpose of this paper is to show that if one adopts conditional probabilities as the primitive concept of probability, one must deal with the fact that even in very ordinary circumstances at least some probability values may be imprecise, and that some probability questions may fail to have numerically precise answers.

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)

In this dissertation I provide a novel logic of the ordinary-language conditional. First, however, I endeavor to make clearer and more precise just what the objects of the study of the conditional are, as a lack of clarity as to what counts as an instance of a given category of conditional has resulted in deep and significant confusions in subsequent analysis. I motivate for a factual/counterfactual distinction, though not at the level of particular instances of the conditional. Instead, I argue (...) that each individual instance of the conditional may be interpreted either factually or counterfactually, rather than these instances dividing into distinct types. I examine the classic Oswald–Kennedy pair of sentences, typically taken to be the quintessential example of how conditionals must be split into two different categories, to show that they in fact do not demonstrate this. I then present my account of the logic underlying the ordinary-language conditional, the system C3, and a justification of the form it takes. This logic provides distinct interpretations of the conditional as it concerns what is factual or what is counterfactual, respectively. The factual interpretation is true when both antecedent and consequent are true at the actual world, false when the antecedent is true and consequent false, and not truth-apt otherwise. The counterfactual interpretation incorporates a ceteris paribus clause, ensuring that it is not falsified by extraordinary, unforeseeable occurrences, and is true when, at all worlds at which the antecedent is ceteris paribus true, the consequent too is true. It is false when, at any of these worlds the consequent is false; and not truth-apt otherwise. I go on to examine alternative theories of the conditional—from the suppositionalist approach to evaluating the putative indicative conditional, to Stalnaker’s combined indicative and counterfactual account, and Lewis’s analysis of the counterfactual; among a number of others—and offer comparison to my own theory. Finally, I look at various challenges to my account of the conditional. Being a strict conditional (albeit variably so), that of C3 is open to the objection that it fails to match ordinary speakers’ intuitions as regards its truth-value assignments to, for instance, conditionals with necessarily true consequents. I address these so- called paradoxes of the strict conditional, and also discussion the question of truth-preservation in the C3 system in the case of such inferences as those relying on transitivity and that of modus ponens. I maintain that these inferences are indeed truth-preserving under certain, specifiable, conditions, and I close by offering possible avenues for further research. (shrink)

What is it to believe something might be the case? We develop a puzzle that creates difficulties for standard answers to this question. We go on to propose our own solution, which integrates a Bayesian approach to belief with a dynamic semantics for epistemic modals. After showing how our account solves the puzzle, we explore a surprising consequence: virtually all of our beliefs about what might be the case provide counterexamples to the view that rational belief is closed under logical (...) implication. (shrink)

This article investigates the properties of multistate top revision, a dichotomous model of belief revision that is based on an underlying model of probability revision. A proposition is included in the belief set if and only if its probability is either 1 or infinitesimally close to 1. Infinitesimal probabilities are used to keep track of propositions that are currently considered to have negligible probability, so that they are available if future information makes them more plausible. Multistate top revision satisfies a (...) slightly modified version of the set of basic and supplementary AGM postulates, except the inclusion and success postulates. This result shows that hyperreal probabilities can provide us with efficient tools for overcoming the well known difficulties in combining dichotomous and probabilistic models of belief change. (shrink)

I I set out my view that all inference is essentially deductive and pinpoint what I take to be the major shortcomings of the induction rule.II The import of data depends on the probability model of the experiment, a dependence ignored by the induction rule. Inductivists admit background knowledge must be taken into account but never spell out how this is to be done. As I see it, that is the problem of induction.III The induction rule, far from providing a (...) method of discovery, does not even serve to detect pattern. Knowing that there is uniformity in the universe is no help to discovering laws. A critique of Reichenbach's justification of the straight rule is constructed along these lines.IV The induction rule, by itself, cannot account for the varying rates at which confidence in an hypothesis mounts with data. The mathematical analysis of this salient feature of inductive reasoning requires prior probabilities. We also argue, against orthodox statisticians, that prior probabilities make a substantive contribution to the objectivity of inductive methods, viz. to the design of experiments and the selection of decision rules.V Carnap's general criticisms of various estimation rules, like the straight rule and the ‘impervious rule’, are seen to be misguided when the prior densities to which they correspond are taken into account.VI Analysis of Hempel's definition of confirmation qua formalization of the enumerative (naive) conception of instancehood. We show that from the standpoint of the quantitative measure P(H/E):P(H) for the degree to which E confirms H, Hempel's classificatory concept yields correct results only for sampling at large from a finite population with a two-way classification all of whose compositions are equally probable. We extend the analysis to Goodman's paradox, finding cases in which grue-like hypotheses do receive as much confirmation as their opposite numbers. We argue, moreover, the irrelevancy of entrenchment, and maintain that Goodman's paradox is no more than a straightforward counter-example to the enumerative conception of instancehood embodied in Hempel's definition.VII We rebutt the objection that prior probabilities, qua inputs of Bayesian analysis, can only be obtained by enumerative induction (insofar as they are objective). The divergence in the prior densities of two rational agents is less a function of subjectivity, we maintain, than of vagueness.VIII Our concluding remarks stress that, for Bayesians, there is no problem of induction in the usual sense. (shrink)

We examine the notion of conditionals and the role of conditionals in inductive logics and arguments. We identify three mistakes commonly made in the study of, or motivation for, non-classical logics. A nonmonotonic consequence relation based on evidential probability is formulated. With respect to this acceptance relation some rules of inference of System P are unsound, and we propose refinements that hold in our framework.

I will describe the logics of a range of conditionals that behave like conditional probabilities at various levels of probabilistic support. Families of these conditionals will be characterized in terms of the rules that their members obey. I will show that for each conditional, →, in a given family, there is a probabilistic support level r and a conditional probability function P such that, for all sentences C and B, 'C → B' holds just in case P[B | C] ≥ (...) r. Thus, each conditional in a given family behaves like conditional probability above some specific support level. (shrink)

Frank Plumpton Ramsey (1903–30) made seminal contributions to philosophy, mathematics and economics. Whilst he was acknowledged as a genius by his contemporaries, some of his most important ideas were not appreciated until decades later; now better appreciated, they continue to bear an influence upon contemporary philosophy. His historic significance was to usher in a new phase of analytic philosophy, which initially built upon the logical atomist doctrines of Bertrand Russell and Ludwig Wittgenstein, raising their ideas to a new level of (...) sophistication, but ultimately he became their successor rather than remain a mere acolyte. (shrink)

Henry Kyburg’s lottery paradox (1961, p. 197) arises from considering a fair 1000 ticket lottery that has exactly one winning ticket. If this much is known about the execution of the lottery it is therefore rational to accept that one ticket will win. Suppose that an event is very likely if the probability of its occurring is greater than 0.99. On these grounds it is presumed rational to accept the proposition that ticket 1 of the lottery will not win. Since (...) the lottery is fair, it is rational to accept that ticket 2 won’t win either—indeed, it is rational to accept for any individual ticket i of the lottery that ticket i will not win. However, accepting that ticket 1 won’t win, accepting that ticket 2 won’t win, . . . , and accepting that ticket 1000 won’t win entails that it is rational to accept that no ticket will win, which entails that it is rational to accept the contradictory proposition that one ticket wins and no ticket wins. (shrink)

I aim to show that standard theories of counterfactuals are mistaken, not in detail, but in principle, and I aim to say what form a tenable theory must take. Standard theories entail a categorical interpretation of counterfactuals, on which to state that, if it were that A, it would be that C is to state something, not relative to any supposition or hypothesis, but categorically. On the rival suppositional interpretation, to state that, if it were that A, it would be (...) that C is to state that it would be that C relative to the supposition that it were that A. The two interpretations make incompatible predictions concerning the correct evaluation of counterfactuals. I argue that the suppositional interpretation makes the correct prediction. (shrink)

In this paper, we propose a unified account of conditionals inspired by Frank Ramsey. Most contemporary philosophers agree that Ramsey’s account applies to indicative conditionals only. We observe against this orthodoxy that his account covers subjunctive conditionals as well—including counterfactuals. In light of this observation, we argue that Ramsey’s account of conditionals resembles Robert Stalnaker’s possible worlds semantics supplemented by a model of belief. The resemblance suggests to reinterpret the notion of conditional degree of belief in order to overcome a (...) tension in Ramsey’s account. The result of the reinterpretation is a tenable account of conditionals that covers indicative and subjunctive as well as qualitative and probabilistic conditionals. (shrink)

This paper uses a non-distributive system of Boolean fractions (a|b), where a and b are 2-valued propositions or events, to express uncertain conditional propositions and conditional events. These Boolean fractions, 'a if b' or 'a given b', ordered pairs of events, which did not exist for the founders of quantum logic, can better represent uncertain conditional information just as integer fractions can better represent partial distances on a number line. Since the indeterminacy of some pairs of quantum events is due (...) to the mutual inconsistency of their experimental conditions, this algebra of conditionals can express indeterminacy. In fact, this system is able to express the crucial quantum concepts of orthogonality, simultaneous verifiability, compatibility, and the superposition of quantum events, all without resorting to Hilbert space. A conditional (a|b) is said to be "inapplicable" (or "undefined") in those instances or models for which b is false. Otherwise the conditional takes the truth-value of proposition a. Thus the system is technically 3-valued, but the 3rd value has nothing to do with a state of ignorance, nor to some half-truth. People already routinely put statements into three categories: true, false, or inapplicable. As such, this system applies to macroscopic as well as microscopic events. Two conditional propositions turn out to be simultaneously verifiable just in case the truth of one implies the applicability of the other. Furthermore, two conditional propositions (a|b) and (c|d) reside in a common Boolean sub-algebra of the non-distributive system of conditional propositions just in case b = d, their conditions are equivalent. Since all aspects of quantum mechanics can be represented with this near classical logic, there is no need to adopt Hilbert space logic as ordinary logic, just a need perhaps to adopt propositional fractions to do logic, just as we long ago adopted integer fractions to do arithmetic. The algebra of Boolean fractions is a natural, near-Boolean extension of Boolean algebra adequate to express quantum logic. While this paper explains one group of quantum anomalies, it nevertheless leaves no less mysterious the 'influence-at-a-distance', quantum entanglement phenomena. A quantum realist must still embrace non-local influences to hold that "hidden variables" are the measured properties of particles. But that seems easier than imaging wave-particle duality and instant collapse, as offered by proponents of the standard interpretation of quantum mechanics. (shrink)

A recent development in the cognitive science of reasoning has been the emergence of a probabilistic approach to the behaviour observed on ostensibly logical tasks. According to this approach the errors and biases documented on these tasks occur because people import their everyday uncertain reasoning strategies into the laboratory. Consequently participants' apparently irrational behaviour is the result of comparing it with an inappropriate logical standard. In this article, we contrast the probabilistic approach with other approaches to explaining rationality, and then (...) show how it has been applied to three main areas of logical reasoning: conditional inference, Wason's selection task and syllogistic reasoning. (shrink)

Conditional probability and selection-function approaches to chancy subjunctive conditionals are compared in a simple and transparent setting. They are seen to be alternative ways of calculating the same quantity. This unification extends from core cases to more peripheral cases.

The sum, difference, product and quotient of two functions with different domains are usually defined only on their common domain. This paper extends these definitions so that the sum and other operations are essentially defined anywhere that at least one of the components is defined. This idea is applied to propositions and events, expressed as indicator functions, to define conditional propositions and conditional events as three-valued indicator functions that are undefined when their condition is false. Extended operations of "and", "or", (...) "not" and "conditioning" are then defined on these conditional events with variable conditions. The probabilities of the disjunction and of the conjunction of two conditionals are expressed in terms of the conditional probabilities of the component conditionals. In a special case, these are shown to be weighted averages of the component conditional probabilities where the weights are the relative probabilities of the various conditions. Next, conditional random variables are defined to be random variables X whose domain has been restricted by a condition on a second random variable Y. The extended sum, difference, product and conditioning operations on functions are then applied to these conditional random variables. The expectation of a random variable and the conditional expectation of a conditional random variable are recounted. Theorem 1 generalizes the standard result that the conditional expectation of the sum of two conditional random variables with disjoint and exhaustive conditions is a weighted sum of the conditional expectations of the component conditional random variables. Because of the extended operations, the theorem is true for arbitrary conditions. Theorem 2 gives a formula for the expectation of the product of two conditional random variables. After the definition of independence of two random variables is extended to accommodate the extended operations, it is applied to the formula of Theorem 2 to simplify the expectation of a product of conditional random variables. Two examples end the paper. The first concerns a work force of n workers of different output levels and work shifts. The second example involves two radars with overlapping surveillance regions and different detection error rates. One radar's error rate is assumed to be sensitive to fog and the other radar's error rate is assumed to be sensitive to air traffic density. The combined error rate over the combined surveillance region given heavy fog and moderate air traffic is computed. (shrink)

We derive a probabilistic account of the vagueness and context-sensitivity of scalar adjectives from a Bayesian approach to communication and interpretation. We describe an iterated-reasoning architecture for pragmatic interpretation and illustrate it with a simple scalar implicature example. We then show how to enrich the apparatus to handle pragmatic reasoning about the values of free variables, explore its predictions about the interpretation of scalar adjectives, and show how this model implements Edgington’s Vagueness: a reader, 1997) account of the sorites paradox, (...) with variations. The Bayesian approach has a number of explanatory virtues: in particular, it does not require any special-purpose machinery for handling vagueness, and it is integrated with a promising new approach to pragmatics and other areas of cognitive science. (shrink)

This article begins by outlining some of the history—beginning with brief remarks of Quine's—of work on conditional assertions and conditional events. The upshot of the historical narrative is that diverse works from various starting points have circled around a nexus of ideas without convincingly tying them together. Section 3 shows how ideas contained in a neglected article of de Finetti's lead to a unified treatment of the topics based on the identification of conditional events as the objects of conditional bets. (...) The penultimate section explores some of the consequences of the resulting logic of conditional events while the last defends it. (shrink)

Let us call a statement of the form ‘If A was, is, or will be the case, then C was, is, or will be the case’ an indicative conditional. And let us call a statement of the form ‘If A had been, were, or were to be the case, then C would have been, would be, or would come to be the case’ a subjunctive, or counterfactual, conditional.

An assertion of high conditional probability or, more briefly, an HCP assertion is a statement of the type: The conditional probability of B given A is close to one. The goal of this paper is to construct logics of HCP assertions whose conclusions are highly likely to be correct rather than certain to be correct. Such logics would allow useful conclusions to be drawn when the premises are not strong enough to allow conclusions to be reached with certainty. This goal (...) is achieved by taking Adams' (1966) logic, changing its intended application from conditionals to HCP assertions, and then weakening its criterion for entailment. According to the weakened entailment criterion, called the Criterion of Near Surety and which may be loosely interpreted as a Bayesian criterion, a conclusion is entailed if and only if nearly every model of the premises is a model of the conclusion. The resulting logic, called NSL, is nonmonotonic. Entailment in this logic, although not as strict as entailment in Adams' logic, is more strict than entailment in the propositional logic of material conditionals. Next, NSL was modified by requiring that each HCP assertion be scaled; this means that to each HCP assertion was associated a bound on the deviation from 1 of the conditional probability that is the subject of the assertion. Scaling of HCP assertions is useful for breaking entailment deadlocks. For example, it it is known that the conditional probabilities of C given A and of - C given B are both close to one but the bound on the former's deviation from 1 is much smaller than the latter's, then it may be concluded that in all likelihood the conditional probability of C given A ∧ B is close to one. The resulting logic, called NSL-S, is also nonmonotonic. Despite great differences in their definitions of entailment, entailment in NSL is equivalent to Lehmann and Magidor's rational closure and, disregarding minor differences concerning which premise sets are considered consistent, entailment in NSL-S is equivalent to entailment in Goldszmidt and Pearl's System-Z⁺. Bacchus, Grove, Halpern, and Koller proposed two methods of developing a predicate calculus based on the Criterion of Near Surety. In their randomstructures method, which assumed a prior distribution similar to that of NSL, it appears possible to define an entailment relation equivalent to that of NSL. In their random-worlds method, which assumed a prior distribution dramatically different from that of NSL, it is known that the entailment relation is different from that of NSL. (shrink)

The explanation of the suppression of Modus Ponens inferences within the framework of linguistic pragmatics and of plausible reasoning (i.e., deduction from uncertain premises) is defended. First, this approach is expounded, and then it is shown that the results of the first experiment of Byrne, Espino, and Santamar a (1999) support the uncertainty explanation but fail to support their counterexample explanation. Second, two experiments are presented. In the first one, aimed to refute one objection regarding the conclusions observed, the additional (...) conditional premise ( if N, C ) was replaced with a statement of uncertainty ( it is not certain that N ); the answers produced by the participants remained qualitatively and quantitatively similar in both conditions. In the second experiment, a fine-grained analysis of the responses to and justifications for an evaluation task was performed. The results of both experiments strongly supported the uncertainty explanation. (shrink)

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.

There is the idea that rational belief for a single individual can be constructed via a process of unilateral argument. To preempt antipathy between the AI communities that can claim the idea that rational belief can be so constructed, we trace the idea to the beginning of this century, to Keynes' dispute with Russell over logic and probability. We review how Keynesian ideas were revived in AI's work on non-monotonic reasoning and parallel developments in philosophical logic.