- Submit
-
Browse
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- More
Switch to: References
Citations of:
Conditional probabilities and compounds of conditionals
Philosophical Review 98 (4):485-541 (1989)
Add citations
You must login to add citations.
|
|
|
We present two approaches to investigate the validity of connexive principles and related formulas and properties within coherence-based probability logic. Connexive logic emerged from the intuition that conditionals of the form if not-A, thenA, should not hold, since the conditional’s antecedent not-A contradicts its consequent A. Our approaches cover this intuition by observing that the only coherent probability assessment on the conditional event $${A| \overline{A}}$$ A | A ¯ is $${p(A| \overline{A})=0}$$ p ( A | A ¯ ) = 0. (...) |
|
|
|
|
|
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 (...) |
|
|
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 (...) |
|
|
The ontology of decision theory has been subject to considerable debate in the past, and discussion of just how we ought to view decision problems has revealed more than one interesting problem, as well as suggested some novel modifications of classical decision theory. In this paper it will be argued that Bayesian, or evidential, decision-theoretic characterizations of decision situations fail to adequately account for knowledge concerning the causal connections between acts, states, and outcomes in decision situations, and so they are (...) |
|
|
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 (...) |
|
|
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 (...) |
|
|
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 (...) |
|
|
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 (...) |
|
|
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 (...) |
|
|
This paper explores the interaction of well-motivated (if controversial) principles governing the probability conditionals, with accounts of what it is for a sentence to be indefinite. The conclusion can be played in a variety of ways. It could be regarded as a new reason to be suspicious of the intuitive data about the probability of conditionals; or, holding fixed the data, it could be used to give traction on the philosophical analysis of a contentious notion—indefiniteness. The paper outlines the various (...) |
|
|
Chalmers and Hájek argue that on an epistemic reading of Ramsey’s test for the rational acceptability of conditionals, it is faulty. They claim that applying the test to each of a certain pair of conditionals requires one to think that one is omniscient or infallible, unless one forms irrational Moore-paradoxical beliefs. I show that this claim is false. The epistemic Ramsey test is indeed faulty. Applying it requires that one think of anyone as all-believing and if one is rational, to (...) |
|
|
In this paper we discuss the new Tweety puzzle. The original Tweety puzzle was addressed by approaches in non-monotonic logic, which aim to adequately represent the Tweety case, namely that Tweety is a penguin and, thus, an exceptional bird, which cannot fly, although in general birds can fly. The new Tweety puzzle is intended as a challenge for probabilistic theories of epistemic states. In the first part of the paper we argue against monistic Bayesians, who assume that epistemic states can (...) |
|
|
We investigate a lattice of conditional logics described by a Kripke type semantics, which was suggested by Chellas and Segerberg – Chellas–Segerberg (CS) semantics – plus 30 further principles. We (i) present a non-trivial frame-based completeness result, (ii) a translation procedure which gives one corresponding trivial frame conditions for arbitrary formula schemata, and (iii) non-trivial frame conditions in CS semantics which correspond to the 30 principles. |
|
|
A uniform theory of conditionals is one which compositionally captures the behavior of both indicative and subjunctive conditionals without positing ambiguities. This paper raises new problems for the closest thing to a uniform analysis in the literature (Stalnaker, Philosophia, 5, 269–286 (1975)) and develops a new theory which solves them. I also show that this new analysis provides an improved treatment of three phenomena (the import-export equivalence, reverse Sobel-sequences and disjunctive antecedents). While these results concern central issues in the study (...) |
|
|
Following Nancy Cartwright and others, I suggest that most (if not all) theories incorporate, or depend on, one or more idealizing assumptions. I then argue that such theories ought to be regimented as counterfactuals, the antecedents of which are simplifying assumptions. If this account of the logic form of theories is granted, then a serious problem arises for Bayesians concerning the prior probabilities of theories that have counterfactual form. If no such probabilities can be assigned, the the posterior probabilities will (...) |
|
|
This paper explores the possibility of supplementing the suppositional view of indicative conditionals with a corresponding view of epistemic modals. The most striking feature of the suppositional view consists in its claim that indicative conditionals are to be evaluated by conditional probabilities. On the basis of a natural link between indicative conditionals and epistemic modals, a corresponding thesis about the probabilities of statements governed by epistemic modals can be derived. The paper proceeds by deriving further consequences of this thesis, in (...) |
|
|
There seem to be two ways of supposing a proposition: supposing “indicatively” that Shakespeare didn’t write Hamlet, it is likely that someone else did; supposing “subjunctively” that Shakespeare hadn’t written Hamlet, it is likely that nobody would have written the play. Let P be the probability of B on the subjunctive supposition that A. Is P equal to the probability of the corresponding counterfactual, A □→B? I review recent triviality arguments against this hypothesis and argue that they do not succeed. (...) |
|
|
Systems of logico-probabilistic reasoning characterize inference from conditional assertions that express high conditional probabilities. In this paper we investigate four prominent LP systems, the systems _O, P_, _Z_, and _QC_. These systems differ in the number of inferences they licence _. LP systems that license more inferences enjoy the possible reward of deriving more true and informative conclusions, but with this possible reward comes the risk of drawing more false or uninformative conclusions. In the first part of the paper, we (...) |
|
|
There is a renewed debate about modus ponens. Strikingly, the recent counterexamples in Cantwell, Dreier and MacFarlane and Kolodny are generated by restricted readings of the ‘if’-clause. Moreover, it can be argued on general grounds that the restrictor view of conditionals developed in Kratzer and Lewis leads to counterexamples to modus ponens. This paper provides a careful analysis of modus ponens within the framework of the restrictor view. Despite appearances to the contrary, there is a robust sense in which modus (...) |
|
|
|
|
|
|
|
|
David Lewis’s semantics for counterfactuals remains the standard view. Yet counter-examples have emerged, which suggest a need to invoke causal independence, and thus threaten conceptual circularity. I will review some of these counter-examples (§§1–2), illustrate how causal independence proves useful (§3), and suggest that any resulting circularity is unproblematic (§4). |
|
|
Stalnaker's Thesis about indicative conditionals is, roughly, that the probability one ought to assign to an indicative conditional equals the probability that one ought to assign to its consequent conditional on its antecedent. The thesis seems right. If you draw a card from a standard 52-card deck, how confident are you that the card is a diamond if it's a red card? To answer this, you calculate the proportion of red cards that are diamonds -- that is, you calculate the (...) |
|
|
I present some counterexamples to Adams's Thesis and explain how they undermine arguments that indicative conditionals cannot be truth-evaluable propositions. |
|
|
(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. |
|
|
IntroductionThe project of giving an account of meaning in natural languages goes largely by assigning truth-conditional content to sentences. I will call the view that sentences have truth-conditional content propositionalism as it is common to identify the truth-conditional content of a sentence with the proposition it expresses. This content plays an important role in our explanations of the speech-acts, attitude ascriptions, and the meaning of sentences when they appear as parts of longer sentences. Much work in philosophy of language and (...) |
|
|
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 (...) |
|
|
This position paper advocates combining formal epistemology and the new paradigm psychology of reasoning in the studies of conditionals and reasoning with uncertainty. The new paradigm psychology of reasoning is characterized by the use of probability theory as a rationality framework instead of classical logic, used by more traditional approaches to the psychology of reasoning. This paper presents a new interdisciplinary research program which involves both formal and experimental work. To illustrate the program, the paper discusses recent work on the (...) |
|
|
Earlenbaugh and Molyneux’s argument against considering intuitions as evidence has an uncharitable consequence — a substantial part of philosophical practice is not justified. A possible solution to this problem is to defend that philosophy must be descriptive metaphysics. But if this statement is rejected, one can only argue (a) that experts’ intuition does constitute evidence, and (b) that philosophical practice is justified by the overall growth of philosophical knowledge it generates. |
|
|
Thought: A Journal of Philosophy, EarlyView. |
|
|
The semantics Vann McGee gives for his 1989 conditional logic is based on Stalnaker’s 1968 semantics but replaces the familiar concept of truth at a world with the novel concept of truth under a hypothesis. Developed here is a semantics of the standard type, in which sentences are true at worlds, only with additional constraints imposed on the accessibility relation and the selection function. McGee conditionals of the form A ⇒ X are translated into Stalnaker conditionals of the form \A (...) |
|
|
I argue against the Ramsey test connecting indicative conditionals with conditional probability, by means of examples in which conditional probability is high but the conditional is intuitively implausible. At the end of the paper, I connect these issues to patterns of belief revision. |
|
|
|
|
|
|
|
|
|
|
|
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 Identity principle says that conditionals with the form 'If p, then p' are logical truths. Identity is overwhelmingly plausible, and has rarely been explicitly challenged. But a wide range of conditionals nonetheless invalidate it. I explain the problem, and argue that the culprit is the principle known as Import-Export, which we must thus reject. I then explore how we can reject Import-Export in a way that still makes sense of the intuitions that support it, arguing that the differences between (...) |
|
|
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. (...) |
|
|
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 (...) |
|
|
Colin Howson argues that (1) my sociologistic reliabilism sheds no light on the objectivity of epistemic content, and that (2) sorites does not threaten the reliability of modus ponens . I reply that argument (1) misrepresents my position, and that argument (2) is beside the point. |
|
|
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 (...) |
|
|
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 (...) |
|
|
The connection between the probabilities of conditionals and the corresponding conditional probabilities has long been explored in the philosophical literature, but its implementation faces both technical obstacles and objections on empirical grounds. In this paper I ?rst outline the motivation for the probabilistic turn and Lewis’ triviality results, which stand in the way of what would seem to be its most straightforward implementation. I then focus on Richard Jeffrey’s ’random-variable’ approach, which circumvents these problems by giving up the notion that (...) |
|
|
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 (...) |
|
|
– 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 (...) |
|
|
A recent article by Jeff Kochan contains a discussion of modus ponens that among other thing alleges that the paradox of the heap is a counterexample to it. In this note I show that it is the conditional major premise of a modus ponens inference, rather than the rule itself, that is impugned. This premise is the contrapositive of the inductive step in the principle of mathematical induction, confirming the widely accepted view that it is the vagueness of natural language (...) |
|
|
This paper argues that two widely accepted principles about the indicative conditional jointly presuppose the falsity of one of the most prominent arguments against epistemological iteration principles. The first principle about the indicative conditional, which has close ties both to the Ramsey test and the “or‐to‐if” inference, says that knowing a material conditional suffices for knowing the corresponding indicative. The second principle says that conditional contradictions cannot be true when their antecedents are epistemically possible. Taken together, these principles entail that (...) |
|
|
The so-called ‘Adams’ Thesis’ is often understood as the claim that the assertibility of an indicative conditional equals the corresponding conditional probability—schematically: $${({\rm AT})}\qquad\qquad\quad As(A\rightarrow B)=P({B|A}),{\rm provided}\quad P(A)\neq 0.$$ The Thesis is taken by many to be a touchstone of any theorizing about indicative conditionals. Yet it is unclear exactly what the Thesis is . I suggest some precise statements of it. I then rebut a number of arguments that have been given in its favor. Finally, I offer a new (...) |
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-5tf24 uwo