Conditional Probability

Many philosophers have become worried about the use of standard real numbers for the probability function that represents an agent's credences. They point out that real numbers can't capture the distinction between certain extremely unlikely events and genuinely impossible ones—they are both represented by credence 0, which violates a principle known as “regularity.” Following Skyrms 1980 and Lewis 1980, they recommend that we should instead use a much richer set of numbers, called the “hyperreals.” This essay argues that this popular (...) view is the result of two mistakes. The first mistake, which this essay calls the “numerical fallacy,” is to assume that a distinction that isn't represented by different numbers isn't represented at all in a mathematical representation. In this case, the essay claims that although the real numbers do not make all relevant distinctions, the full mathematical structure of a probability function does. The second mistake is that the hyperreals make too many distinctions. They have a much more complex structure than credences in ordinary propositions can have, so they make distinctions that don't exist among credences. While they might be useful for generating certain mathematical models, they will not appear in a faithful mathematical representation of credences of ordinary propositions. (shrink)

(2014). Capturing the relationship between conditionals and conditional probability with a trivalent semantics. Journal of Applied Non-Classical Logics: Vol. 24, Three-Valued Logics and their Applications, pp. 144-152. doi: 10.1080/11663081.2014.911535.

This paper argues that the technical notion of conditional probability, as given by the ratio analysis, is unsuitable for dealing with our pretheoretical and intuitive understanding of both conditionality and probability. This is an ontological account of conditionals that include an irreducible dispositional connection between the antecedent and consequent conditions and where the conditional has to be treated as an indivisible whole rather than compositional. The relevant type of conditionality is found in some well-defined group of conditional statements. As an (...) alternative, therefore, we briefly offer grounds for what we would call an ontological reading: for both conditionality and conditional probability in general. It is not offered as a fully developed theory of conditionality but can be used, we claim, to explain why calculations according to the RATIO scheme does not coincide with our intuitive notion of conditional probability. What it shows us is that for an understanding of the whole range of conditionals we will need what John Heil (2003), in response to Quine (1953), calls an ontological point of view. (shrink)

Numerous triviality results have been directed at a collection of views that tie the probability of a conditional sentence to the conditional probability of the consequent on its antecedent. -/- In this paper I argue that this identification makes little sense if conditional sentences are context sensitive. The best alternative, I argue, is a version of the thesis which states that if your total evidence is E then the evidential probability of a conditional evaluated in a context where E is (...) salient is the probability of the consequent given the antecedent. The biggest challenge to this thesis comes from the 'static' triviality arguments developed by Stalnaker, Hajek and Hall. It is argued that these arguments rely on invalid principles of conditional logic and that the thesis is consistent with a reasonably strong logic that does not include the principles in question. (shrink)

I argue for a connection between two debates in the philosophy of probability. On the one hand, there is disagreement about conditional probability. Is it to be defined in terms of unconditional probability, or should we instead take conditional probability as the primitive notion? On the other hand, there is disagreement about how additive probability is. Is it merely finitely additive, or is it additionally countably additive? My thesis is that, if conditional probability is primitive, then it is not countably (...) additive. (shrink)

IBE ('Inference to the best explanation' or abduction) is a popular and highly plausible theory of how we should judge the evidence for claims of past events based on present evidence. It has been notably developed and supported recently by Meyer following Lipton. I believe this theory is essentially correct. This paper supports IBE from a probability perspective, and argues that the retrodictive probabilities involved in such inferences should be analysed in terms of predictive probabilities and a priori probability ratios (...) of initial events. The key point is to separate these two features. Disagreements over evidence can be traced to disagreements over either the a priori probability ratios or predictive conditional ratios. In many cases, in real science, judgements of the former are necessarily subjective. The principles of iterated evidence are also discussed. The Sceptic's position is criticised as ignoring iteration of evidence, and characteristically failing to adjust a priori probability ratios in response to empirical evidence. (shrink)

A large number of essays address the Sleeping Beauty problem, which undermines the validity of Bayesian inference and Bas Van Fraassen's 'Reflection Principle'. In this study a straightforward analysis of the problem based on probability theory is presented. The key difference from previous works is that apart from the random experiment imposed by the problem's description, a different one is also considered, in order to negate the confusion on the involved conditional probabilities. The results of the analysis indicate that no (...) inconsistency takes place, whereas both Bayesian inference and 'Reflection Principle' are valid. (shrink)

The Equation (TE) states that the probability of A → B is the probability of B given A. Lewis (1976) has shown that the acceptance of TE implies that the probability of A → B is the probability of B, which is implausible: the probability of a conditional cannot plausibly be the same as the probability of its consequent, e.g., the probability that the match will light given that is struck is not intuitively the same as the probability that it (...) will light. Here I want to counter Lewis’ claim. My aim is to argue that: (1) TE express the coherence requirements implicit in the probability distributions of a modus ponens inference (MP); (2) the triviality result is not implausible because it is a result from these requirements; (3) these coherence requirements measure MP employability, so TE significance is tied to it; (4) MP employability doesn’t provide either the acceptability or the truth conditions of conditionals, since MP employability depends on previous independent reasons to accept the conditional and some acceptable conditionals are not MP friendly. Consequently, TE doesn’t have the logical significance that is usually attributed to it. (shrink)

Journal of Philosophical Logic 34, 97-119, 2005.

A stereotype is a belief or claim that a group of people has a particular feature. Stereotypes are expressed by sentences that have the form of generic statements, like “Canadians are nice.” Recent work on generics lends new life to understanding generics as statements involving probabilities. I argue that generics (and thus sentences expressing stereotypes) can take one of several forms involving conditional probabilities, and these probabilities have what I call a naturalness requirement. This is the natural probability theory of (...) stereotypes. Each of the two components of the theory entails a family of fallacies that contributes to the spurious reinforcement of stereotypes: inferential slippage within and between the different generic forms, and inferential slippage from facts about frequencies of group traits to beliefs about natural propensities or dispositions of groups. Empirical research suggests that we often commit these fallacies. Moreover, this theory can referee a vitriolic debate between some psychologists, who hold that stereotypes are always false and stereotyping is always wrong, and other psychologists, who hold that stereotypes are often accurate and stereotyping is often reasonable. (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.

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)

I argue that when we use ‘probability’ language in epistemic contexts—e.g., when we ask how probable some hypothesis is, given the evidence available to us—we are talking about degrees of support, rather than degrees of belief. The epistemic probability of A given B is the mind-independent degree to which B supports A, not the degree to which someone with B as their evidence believes A, or the degree to which someone would or should believe A if they had B as (...) their evidence. My central argument is that the degree-of-support interpretation lets us better model good reasoning in certain cases involving old evidence. Degree-of-belief interpretations make the wrong predictions not only about whether old evidence confirms new hypotheses, but about the values of the probabilities that enter into Bayes’ Theorem when we calculate the probability of hypotheses conditional on old evidence and new background information. (shrink)

This paper is devoted to clarification of the notion of entanglement through decoupling it from the tensor product structure and treating as a constraint posed by probabilistic dependence of quantum observable _A_ and _B_. In our framework, it is meaningless to speak about entanglement without pointing to the fixed observables _A_ and _B_, so this is _AB_-entanglement. Dependence of quantum observables is formalized as non-coincidence of conditional probabilities. Starting with this probabilistic definition, we achieve the Hilbert space characterization of the (...) _AB_-entangled states as amplitude non-factorisable states. In the tensor product case, _AB_-entanglement implies standard entanglement, but not vise verse. _AB_-entanglement for dichotomous observables is equivalent to their correlation, i.e., \(\langle AB\rangle _{\psi} \not = \langle A\rangle _{\psi} \langle B\rangle _{\psi}.\) We describe the class of quantum states that are \(A_{u} B_{u}\) -entangled for a family of unitary operators (_u_). Finally, observables entanglement is compared with dependence of random variables in classical probability theory. (shrink)

The value problem for knowledge is the problem of explaining why knowledge is more valuable than mere true belief. The problem arises for reliabilism in particular, i.e., the externalist view that knowledge amounts to reliably acquired true belief. Goldman and Olsson argue that knowledge, in this sense, is more valuable than mere true belief due to the higher likelihood of future true beliefs (produced by the same reliable process) in the case of knowledge. They maintain that their solution works given (...) four empirical assumptions, which they claim hold “normally.” However, they do not show that their assumptions are externalistically acceptable; nor do they provide detailed evidence for their normality claim. We address these remaining gaps in Goldman and Olsson’s solution in a constructive spirit. In particular, we suggest an externalist interpretation of the assumptions such that they essentially spell out what it means for a broad range of organisms capable of belief-like representations to be epistemically adapted to their environment. Our investigation also sheds light on the circumstances in which the assumptions fail to hold and knowledge therefore fails to have extra value in Goldman and Olsson’s sense. The upshot is a deeper understanding of their solution as a contribution to naturalized epistemology and a strengthened case for its empirical validity. (shrink)

We aim to support researchers in social sciences and humanities in conducting and publishing their studies on a global scale, especially Early Career Researchers (ECRs) and those in low-resource settings. For that purpose, AISDL created the Science Portal for the Serendipity-Mindsponge-3D (SM3D) Knowledge Management Theory.

This paper studies connections between two alternatives to the standard probability calculus for representing and reasoning about uncertainty: imprecise probability andcomparative probability. The goal is to identify complete logics for reasoning about uncertainty in a comparative probabilistic language whose semantics is given in terms of imprecise probability. Comparative probability operators are interpreted as quantifying over a set of probability measures. Modal and dynamic operators are added for reasoning about epistemic possibility and updating sets of probability measures.

David Builes presents a paradox concerning how confident you should be that any given member of an infinite collection of fair coins landed heads, conditional on the information that they were all flipped and only finitely many of them landed heads. We argue that if you should have any conditional credence at all, it should be 1/2.

A large body of work has demonstrated the utility of the Bayesian framework for capturing inference in both specialist and everyday contexts. However, the central tool of the framework, conditionalization via Bayes’ rule, does not apply directly to a common type of learning: the acquisition of conditional information. How should an agent change her beliefs on learning that “If A, then C”? This issue, which is central to both reasoning and argumentation, has recently prompted considerable research interest. In this paper, (...) we critique a prominent proposal and provide a new, alternative, answer. -/- . (shrink)

I generalize the notion of a conditional attitude by bringing together two topics of inquiry. One is the ordinary inquiry into conditional attitudes. The other topic is the inquiry into the attitude of thinking that a proposition is likely, or having a high credence in a proposition. For instance, what is it to intend to go to the game if it is likely that Kershaw pitches? Being likely that Kershaw pitches is the condition of the attitude. Given a natural position (...) about statements like “It is likely that Kershaw pitches,” the target attitude looks different from ordinary conditional attitudes. (shrink)

Branden Fitelson and Alan Hájek have suggested that it is finally time for a “revolution” in which we jettison Kolmogorov’s axiomatization of probability, and move to an alternative like Popper’s. According to these authors, not only did Kolmogorov fail to give an adequate analysis of conditional probability, he also failed to give an adequate account of another central notion in probability theory: probabilistic independence. This paper defends Kolmogorov, with a focus on this independence charge. I show that Kolmogorov’s sophisticated theory (...) of conditional distributions, advocated by authors such as Kenny Easwaran but often overlooked by philosophers, has the resources to define the notion of independence Fitelson and Hájek seek. I then argue that Kolmogorov’s original definition of independence, once suitably reinterpreted as capturing a slight logical weakening of this notion, is not so problematic after all. Indeed, rather than discarding Kolmogorov’s definition, we should make room for two distinct notions of probabilistic independence, one stronger and one weaker, which play different theoretical roles. (shrink)

This paper contributes to a recent research program that extends arguments supporting elementary conditionalization to arguments supporting conditionalization with general, measure-theoretic conditional probabilities. I begin by suggesting an amendment to the framework that Rescorla (2018) has used to characterize regular conditional probabilities in terms of avoiding Dutch book. If we wish to model learning scenarios in which an agent gains complete membership knowledge about some subcollection of the events of interest to her, then we should focus on updating policies that (...) are what I shall call proper. I go on to characterize regular conditional probabilities in proper learning scenarios using what van Fraassen (1999) calls The General Reflection Principle. (shrink)

Epistemic decision theory produces arguments with both normative and mathematical premises. I begin by arguing that philosophers should care about whether the mathematical premises (1) are true, (2) are strong, and (3) admit simple proofs. I then discuss a theorem that Briggs and Pettigrew (2020) use as a premise in a novel accuracy-dominance argument for conditionalization. I argue that the theorem and its proof can be improved in a number of ways. First, I present a counterexample that shows that one (...) of the theorem’s claims is false. As a result of this, Briggs and Pettigrew’s argument for conditionalization is unsound. I go on to explore how a sound accuracy-dominance argument for conditionalization might be recovered. In the course of doing this, I prove two new theorems that correct and strengthen the result reported by Briggs and Pettigrew. I show how my results can be combined with various normative premises to produce sound arguments for conditionalization. I also show that my results can be used to support normative conclusions that are stronger than the one that Briggs and Pettigrew’s argument supports. Finally, I show that Briggs and Pettigrew’s proofs can be simplified considerably. (shrink)

We provide counterexamples to some purported characterizations of dilation due to Pedersen and Wheeler :1305–1342, 2014, ISIPTA ’15: Proceedings of the 9th international symposium on imprecise probability: theories and applications, 2015).

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.

Self-locating beliefs cause a problem for conditionalization. Miriam Schoenfield offers a solution: that on learning E, agents should update on the fact that they learned E. However, Schoenfield is not explicit about whether the fact that they learned E is self-locating. I will argue that if the fact that they learned E is self-locating then the original problem has not been addressed, and if the fact that they learned E is not self-locating then the theory generates implausible verdicts which Schoenfield (...) explicitly rejects. (shrink)

The epistemic probability of A given B is the degree to which B evidentially supports A, or makes A plausible. This paper is a first step in answering the question of what determines the values of epistemic probabilities. I break this question into two parts: the structural question and the substantive question. Just as an object’s weight is determined by its mass and gravitational acceleration, some probabilities are determined by other, more basic ones. The structural question asks what probabilities are (...) not determined in this way—these are the basic probabilities which determine values for all other probabilities. The substantive question asks how the values of these basic probabilities are determined. I defend an answer to the structural question on which basic probabilities are the probabilities of atomic propositions conditional on potential direct explanations. I defend this against the view, implicit in orthodox mathematical treatments of probability, that basic probabilities are the unconditional probabilities of complete worlds. I then apply my answer to the structural question to clear up common confusions in expositions of Bayesianism and shed light on the “problem of the priors.”. (shrink)

In this paper we exploit the notions of conjoined and iterated conditionals, which are defined in the setting of coherence by means of suitable conditional random quantities with values in the interval [0,1]. We examine the iterated conditional (B|K)|(A|H), by showing that A|H p-entails B|K if and only if (B|K)|(A|H) = 1. Then, we show that a p-consistent family F={E1|H1, E2|H2} p-entails a conditional event E3|H3 if and only if E3|H3= 1, or (E3|H3)|QC(S) = 1 for some nonempty subset S (...) of F, where QC(S) is the quasi conjunction of the conditional events in S. Then, we examine the inference rules And, Cut, Cautious Monotonicity, and Or of System P and other well known inference rules (Modus Ponens, Modus Tollens, Bayes). We also show that QC(F)|C(F) = 1, where C(F) is the conjunction of the conditional events in F. We characterize p-entailment by showing that F p-entails E3|H3 if and only if (E3|H3)|C(F) = 1. Finally, we examine Denial of the antecedent and Affirmation of the consequent, where the p-entailment of (E3|H3) from F does not hold, by showing that (E3|H3)|C(F) is not equal to 1. (shrink)

We deepen the study of conjoined and disjoined conditional events in the setting of coherence. These objects, differently from other approaches, are defined in the framework of conditional random quantities. We show that some well known properties, valid in the case of unconditional events, still hold in our approach to logical operations among conditional events. In particular we prove a decomposition formula and a related additive property. Then, we introduce the set of conditional constituents generated by $n$ conditional events and (...) we show that they satisfy the basic properties valid in the case of unconditional events. We obtain a generalized inclusion-exclusion formula, which can be interpreted by introducing a suitable distributive property. Moreover, under logical independence of basic unconditional events, we give two necessary and sufficient coherence conditions. The first condition gives a geometrical characterization for the coherence of prevision assessments on a family F constituted by n conditional events and all possible conjunctions among them. The second condition characterizes the coherence of prevision assessments defined on $F\cup K$, where $K$ is the set of conditional constituents associated with the conditional events in $F$. Then, we give some further theoretical results and we examine some examples and counterexamples. Finally, we make a comparison with other approaches and we illustrate some theoretical aspects and applications. (shrink)

Must probabilities be countably additive? On the one hand, arguably, requiring countable additivity is too restrictive. As de Finetti pointed out, there are situations in which it is reasonable to use merely finitely additive probabilities. On the other hand, countable additivity is fruitful. It can be used to prove deep mathematical theorems that do not follow from finite additivity alone. One of the most philosophically important examples of such a result is the Bayesian convergence to the truth theorem, which says (...) that conditional probabilities converge to 1 for true hypotheses and to 0 for false hypotheses. In view of the long-standing debate about countable additivity, it is natural to ask in what circumstances finitely additive theories deliver the same results as the countably additive theory. This paper addresses that question and initiates a systematic study of convergence to the truth in a finitely additive setting. There is also some discussion of how the formal results can be applied to ongoing debates in epistemology and the philosophy of science. (shrink)

This is a review of Moritz Schulz, COUNTERFACTUALS AND PROBABIITY (Oxford: Oxford University Press, 2017).

We generalize, by a progressive procedure, the notions of conjunction and disjunction of two conditional events to the case of n conditional events. In our coherence-based approach, conjunctions and disjunctions are suitable conditional random quantities. We define the notion of negation, by verifying De Morgan’s Laws. We also show that conjunction and disjunction satisfy the associative and commutative properties, and a monotonicity property. Then, we give some results on coherence of prevision assessments for some families of compounded conditionals; in particular (...) we examine the Fréchet-Hoeffding bounds. Moreover, we study the reverse probabilistic inference from the conjunction Cn+1 of n + 1 conditional events to the family {Cn,En+1|Hn+1}. We consider the relation with the notion of quasi-conjunction and we examine in detail the coherence of the prevision assessments related with the conjunction of three conditional events. Based on conjunction, we also give a characterization of p-consistency and of p-entailment, with applications to several inference rules in probabilistic nonmonotonic reasoning. Finally, we examine some non p-valid inference rules; then, we illustrate by an example two methods which allow to suitably modify non p-valid inference rules in order to get inferences which are p-valid. (shrink)

There is wide support in logic, philosophy, and psychology for the hypothesis that the probability of the indicative conditional of natural language, P(if A then B), is the conditional probability of B given A, P(B|A). We identify a conditional which is such that P(if A then B)=P(B|A) with de Finetti's conditional event, B|A. An objection to making this identification in the past was that it appeared unclear how to form compounds and iterations of conditional events. In this paper, we illustrate (...) how to overcome this objection with a probabilistic analysis, based on coherence, of these compounds and iterations. We interpret the compounds and iterations as conditional random quantities which, given some logical dependencies, may reduce to conditional events. We show how the inference to B|A from A and B can be extended to compounds and iterations of both conditional events and biconditional events. Moreover, we determine the respective uncertainty propagation rules. Finally, we make some comments on extending our analysis to counterfactuals. (shrink)

Merging of opinions results underwrite Bayesian rejoinders to complaints about the subjective nature of personal probability. Such results establish that sufficiently similar priors achieve consensus in the long run when fed the same increasing stream of evidence. Initial subjectivity, the line goes, is of mere transient significance, giving way to intersubjective agreement eventually. Here, we establish a merging result for sets of probability measures that are updated by Jeffrey conditioning. This generalizes a number of different merging results in the literature. (...) We also show that such sets converge to a shared, maximally informed opinion. Convergence to a maximally informed opinion is a (weak) Jeffrey conditioning analogue of Bayesian “convergence to the truth” for conditional probabilities. Finally, we demonstrate the philosophical significance of our study by detailing applications to the topics of dynamic coherence, imprecise probabilities, and probabilistic opinion pooling. (shrink)

This doctoral dissertation investigates what influence indicative conditionals have on belief updating and how learning from conditionals may be modelled in a probabilistic framework. Because the problem is related to the interpretation of conditionals, we first assess different semantics of indicative conditionals. We propose that conditionals should be taken as primary concepts. This allows us to defend a claim that learning a conditional is equivalent to learning that the relevant conditional probability is 1. This implies that learning a conditional can (...) be modelled as learning a material conditional. We then turn to a few competing approaches to the problem of learning from a conditional -- an approach that models these situations with regards to changes in the explanatory status of the antecedent, as minimising probability distances between the prior and posterior probability distributions, and, particularly, an approach based on epistemic entrenchment. It is argued that although all approaches are important for their pioneering contributions, none of them ultimately provides a fully satisfactory solution. We then formulate a proposal according to which learning a conditional may be modelled as learning a material conditional in conjunction with other contextually inferred or observed information. We show that the view has an intuitive appeal on the grounds of pragmatics and empirical research in psychology of reasoning. We also show that the proposed approach successfully resolves all standard cases from the literature. The proposal is then extended to left-nested conditionals. To do so, we first inspect some preliminary empirical data about actual reasoning with nested conditionals and then show that the proposed approach also successfully models these cases. We then investigate how the approach may be extended to the so-called imperative conditionals. We introduce a tripartite typology of imperative conditionals and argue that although imperatives cannot be probabilistically modelled in any straight-forward way, at least some general insights of the proposed method help us understand the influence that the three different types of imperative conditionals have on listeners’ beliefs. We conclude with a summary and some open questions that should be addressed in future work (e.g. the influence of counterfactuals on belief updating). (shrink)

Defenders of Inference to the Best Explanation claim that explanatory factors should play an important role in empirical inference. They disagree, however, about how exactly to formulate this role. In particular, they disagree about whether to formulate IBE as an inference rule for full beliefs or for degrees of belief, as well as how a rule for degrees of belief should relate to Bayesianism. In this essay I advance a new argument against non-Bayesian versions of IBE. My argument focuses on (...) cases in which we are concerned with multiple levels of explanation of some phenomenon. I show that in many such cases, following IBE as an inference rule for full beliefs leads to deductively inconsistent beliefs, and following IBE as a non-Bayesian updating rule for degrees of belief leads to probabilistically incoherent degrees of belief. (shrink)

A group is often construed as one agent with its own probabilistic beliefs (credences), which are obtained by aggregating those of the individuals, for instance through averaging. In their celebrated “Groupthink”, Russell et al. (2015) require group credences to undergo Bayesian revision whenever new information is learnt, i.e., whenever individual credences undergo Bayesian revision based on this information. To obtain a fully Bayesian group, one should often extend this requirement to non-public or even private information (learnt by not all or (...) just one individual), or to non-representable information (not representable by any event in the domain where credences are held). I pro- pose a taxonomy of six types of ‘group Bayesianism’. They differ in the information for which Bayesian revision of group credences is required: public representable information, private representable information, public non-representable information, etc. Six corre- sponding theorems establish how individual credences must (not) be aggregated to ensure group Bayesianism of any type, respectively. Aggregating through standard averaging is never permitted; instead, different forms of geometric averaging must be used. One theorem—that for public representable information—is essentially Russell et al.’s central result (with minor corrections). Another theorem—that for public non-representable information—fills a gap in the theory of externally Bayesian opinion pooling. (shrink)

The thesis that the probability of a conditional`if A, C' is the corresponding conditional probability of C, given A, enjoys wide currency among philosophers and growing empirical support in psychology. In this paper I ask how a probabilisitic account of conditionals along these lines could be extended to unconditional sentences, i.e., conditionals with interrogative antecedents. Such sentences are typically interpreted as equivalent to conjunctions of conditionals. This raises a number of challenges for a probabilistic account, chief among them the question (...) of what the probability of a conjunction of conditionals should be. I offer an analysis which addresses these issues by extending the interpretation of conditionals in Bernoulli models to the case of unconditionals. (shrink)

Various semantics for studying the square of opposition and the hexagon of opposition have been proposed recently. We interpret sentences by imprecise (set-valued) probability assessments on a finite sequence of conditional events. We introduce the acceptability of a sentence within coherence-based probability theory. We analyze the relations of the square and of the hexagon in terms of acceptability. Then, we show how to construct probabilistic versions of the square and of the hexagon of opposition by forming suitable tripartitions of the (...) set of all coherent assessments. Finally, as an application, we present new versions of the square and of the hexagon involving generalized quantifiers. (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 study abductive, causal, and non-causal conditionals in indicative and counterfactual formulations using probabilistic truth table tasks under incomplete probabilistic knowledge (N = 80). We frame the task as a probability-logical inference problem. The most frequently observed response type across all conditions was a class of conditional event interpretations of conditionals; it was followed by conjunction interpretations. An interesting minority of participants neglected some of the relevant imprecision involved in the premises when inferring lower or upper probability bounds on the (...) target conditional/counterfactual ("halfway responses"). We discuss the results in the light of coherence-based probability logic and the new paradigm psychology of reasoning. (shrink)

We present a general framework for representing belief-revision rules and use it to characterize Bayes's rule as a classical example and Jeffrey's rule as a non-classical one. In Jeffrey's rule, the input to a belief revision is not simply the information that some event has occurred, as in Bayes's rule, but a new assignment of probabilities to some events. Despite their differences, Bayes's and Jeffrey's rules can be characterized in terms of the same axioms: "responsiveness", which requires that revised beliefs (...) incorporate what has been learnt, and "conservativeness", which requires that beliefs on which the learnt input is "silent" do not change. To illustrate the use of non-Bayesian belief revision in economic theory, we sketch a simple decision-theoretic application. (shrink)

We study probabilistically informative (weak) versions of transitivity by using suitable definitions of defaults and negated defaults in the setting of coherence and imprecise probabilities. We represent p-consistent sequences of defaults and/or negated defaults by g-coherent imprecise probability assessments on the respective sequences of conditional events. Moreover, we prove the coherent probability propagation rules for Weak Transitivity and the validity of selected inference patterns by proving p-entailment of the associated knowledge bases. Finally, we apply our results to study selected probabilistic (...) versions of classical categorical syllogisms and construct a new version of the square of opposition in terms of defaults and negated defaults. (shrink)

In previous work, we studied four well known systems of qualitative probabilistic inference, and presented data from computer simulations in an attempt to illustrate the performance of the systems. These simulations evaluated the four systems in terms of their tendency to license inference to accurate and informative conclusions, given incomplete information about a randomly selected probability distribution. In our earlier work, the procedure used in generating the unknown probability distribution (representing the true stochastic state of the world) tended to yield (...) probability distributions with moderately high entropy levels. In the present article, we present data charting the performance of the four systems when reasoning in environments of various entropy levels. The results illustrate variations in the performance of the respective reasoning systems that derive from the entropy of the environment, and allow for a more inclusive assessment of the reliability and robustness of the four systems. (shrink)

In this paper I present a precise version of Stalnaker's thesis and show that it is both consistent and predicts our intuitive judgments about the probabilities of conditionals. The thesis states that someone whose total evidence is E should have the same credence in the proposition expressed by 'if A then B' in a context where E is salient as they have conditional credence in the proposition B expresses given the proposition A expresses in that context. The thesis is formalised (...) rigorously and two models are provided that demonstrate that the new thesis is indeed tenable within a standard possible world semantics based on selection functions. Unlike the Stalnaker-Lewis semantics the selection functions cannot be understood in terms of similarity. A probabilistic account of selection is defended in its place. -/- I end the paper by suggesting that this approach overcomes some of the objections often leveled at accounts of indicatives based on the notion of similarity. (shrink)

We study probabilistically informative (weak) versions of transitivity by using suitable definitions of defaults and negated defaults in the setting of coherence and imprecise probabilities. We represent p-consistent sequences of defaults and/or negated defaults by g-coherent imprecise probability assessments on the respective sequences of conditional events. Finally, we present the coherent probability propagation rules for Weak Transitivity and the validity of selected inference patterns by proving p-entailment of the associated knowledge bases.

The standard treatment of conditional probability leaves conditional probability undefined when the conditioning proposition has zero probability. Nonetheless, some find the option of extending the scope of conditional probability to include zero-probability conditions attractive or even compelling. This article reviews some of the pitfalls associated with this move, and concludes that, for the most part, probabilities conditional on zero-probability propositions are more trouble than they are worth.

Conditionals are basic for human reasoning. In our paper, we present two experiments, which for the first time systematically compare how people reason about indicative conditionals (Experiment 1) and counterfactual conditionals (Experiment 2) in causal and non-causal task settings (N = 80). The main result of both experiments is that conditional probability is the dominant response pattern and thus a key ingredient for modeling causal, indicative, and counterfactual conditionals. In the paper, we will give an overview of the main experimental (...) results and discuss their relevance for understanding how people reason about conditionals. (shrink)

This paper discusses conditional probability $$P$$ P , or the probability of A given B. When $$P>0$$ P > 0 , the ratio formula determines $$P$$ P . When $$P=0$$ P = 0 , the ratio formula breaks down. The Borel–Kolmogorov paradox suggests that conditional probabilities in such cases are indeterminate or ill-posed. To analyze the paradox, I explore the relation between probability and intensionality. I argue that the paradox is a Frege case, similar to those that arise in many (...) probabilistic and non-probabilistic contexts. The paradox vividly illustrates how an agent’s way of representing an entity can rationally influence her credal assignments. I deploy my analysis to defend Kolmogorov’s relativistic treatment of conditional probability. (shrink)