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)

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 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)

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 (...) Book against the agent can be constructed. There is a tension between our findings and Lewis’ results, which needs to be explained. Therefore, we present a probability space which corresponds in a natural way to the diachronic Dutch Book—and which allows the conditional A → C to be interpreted as an event in a mathematically sound way. It also allows to formalize the notion of conditionalizing A → C on ¬C which plays a crucial role in Lewis’ proof. Our conclusion is that Lewis’ proof is circular, so it cannot be considered to be a sound argument against PCCP. (shrink)

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 (...) issues such as setting up an axiomatic framework, inference rules, defining semantics, proving completeness, soundness etc. Our theory is motivated by the possible-worlds approach ; however, our model is generally more flexible. In the paper we focus on right-nested conditionals, discussing them in detail. The graph model makes it possible to account in a unified way for both shallow and deep interpretations of right-nested conditionals. In particular, we discuss the status of the Import-Export Principle and PCCP. We briefly discuss some methodological constraints on admissible models and analyze our model with respect to them. The study also illustrates the general problem of finding formal explications of philosophically important notions and applying mathematical methods in analyzing philosophical issues. (shrink)

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 (...) (in particular finite) partial construction can be given. In the paper we provide a new solution to the problem. We show how to construct a finite probability space $$\mathrm {S}^\#=\left(\mathrm\Omega^\#,\mathrm\Sigma^\#,\mathrm P^\#\right)$$ S # = Ω #, Σ #, P # in which simple conditionals and their Boolean combinations can be interpreted. The structure is minimal in terms of cardinality within a certain, naturally defined class of models – an interesting side-effect is an estimate of the number of non-equivalent propositions in the conditional language. We demand that the structure satisfy certain natural assumptions concerning the logic and semantics of conditionals and also that it satisfy PCCP. The construction can be easily iterated, producing interpretations for conditionals of arbitrary complexity. (shrink)

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)

The current special issue focuses on logical and probabilistic approaches to reasoning in uncertain environments, both from a formal, conceptual and argumentative perspective as well as an empirical point of view. In the present introduction we give an overview of the types of problems addressed by the individual contributions of the special issue, based on fundamental distinctions employed in this area. We furthermore describe some of the general features of the special issue.

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 (...) probability of drawing a diamond conditional on drawing a red card. Skyrms' Thesis about counterfactual conditionals is, roughly, that the probability that one ought to assign to a counterfactual equals one's rational expectation of the chance, at a relevant past time, of its consequent conditional on its antecedent. This thesis also seems right. If you decide not to enter a 100-ticket lottery, how confident are you that you would have won had you bought a ticket? To answer this, you calculate the prior chance--that is, the chance just before your decision not to buy a ticket---of winning conditional on entering the lottery. The central project of this article is to develop a new uniform theory of conditionals that allows us to derive a version of Skyrms' Thesis from a version of Stalnaker's Thesis, together with a chance-deference norm relating rational credence to beliefs about objective chance. (shrink)

The literature on indicative conditionals contains two appealing views. The first is the selectional view: on this view, conditionals operate by selecting a single possibility, which is used to evaluate the consequent. The second is the informational view: on this view, conditionals don’t express propositions, but rather impose constraints on information states of speakers. Both views are supported by strong arguments, but they are incompatible on their standard formulations. Hence it appears that we have to choose between mutually exclusive options. (...) But the options are not exclusive. This paper develops a theory of the semantics and assertability of conditionals that is both selectional and informational. The theory vindicates the signature inferences of both selectional and informational theories, including so-called Conditionals Excluded Middle and principles about the interplay between conditionals and ‘might’. It also predicts some interesting and puzzling facts about the assertion of conditionals. (shrink)

This paper presents a general-purpose update semantics for expressions of subjective uncertainty in natural language. First, a set of desiderata are established for how expressions of subjective uncertainty should behave in dynamic, update-based semantic systems; then extant implementations of expressions of subjective uncertainty in such models are evaluated and found wanting; finally, a new update semantics is proposed. The desiderata at the heart of this paper center around the contention that expressions of subjective uncertainty express beliefs which are not persistent, (...) whereas propositions express beliefs that are persistent. I argue that if we make the move of treating updates in a dynamic semantics as Bayesian updates, i.e. as conditionalization, then expressions of subjective uncertainty will behave the way we want them to without altering the way propositions behave. (shrink)

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 (...) counterfactual Ramsey Test makes counterfactuals subject to the very argument that Lewis used to argue against the indicative version of the Ramsey Test. I compare the assumptions needed to run each, pointing to assumptions about the time‐evolution of chances that can replace the appeal to Bayesian assumptions about credence update in motivating the assumptions of the argument. I finish by outlining two reactions to the discussion: to indicativize the debate on counterfactuals; or to counterfactualize the debate on indicatives. (shrink)

According to Stalnaker’s Thesis, the probability of a conditional is the conditional probability. Under some mild conditions, the thesis trivialises probabilities and conditionals, as initially shown by David Lewis. This article asks the following question: does still lead to triviality, if the probability function in is replaced by a probability-like function? The article considers plausibility functions, in the sense of Friedman and Halpern, which additionally mimic probabilistic additivity and conditionalisation. These quasi probabilities comprise Friedman–Halpern’s conditional plausibility spaces, as well as (...) other known representations of conditional doxastic states. The paper proves Lewis’ triviality for quasi probabilities and discusses how this has implications for three other prominent strategies to avoid Lewis’ triviality: Adams’ thesis, where the probability function on the left in is replaced by a probability-like function, abandoning conditionalisation, where probability conditionalisation on the right in is replaced by another propositional update procedure and the approximation thesis, where equality in is replaced by approximation. The paper also shows that Lewis’ triviality result is really about ‘additiveness’ and ‘conditionality’. (shrink)

I give a semantics for a logic with two pairs of doxastic modals and an indicative conditional connective that all nest without restriction. Sentences are evaluated as accepted, rejected, or neither. Certainty is the necessity-like modality of acceptance. Inferences may proceed from premises that are certain, or merely accepted, or a mix of both. This semantic setup yields some striking results. Notably, the existence of inferences that preserve certainty but not acceptance very directly implies both failure of modus ponens for (...) the indicative conditional in the logic of acceptance and failure of the deduction theorem for the material conditional in the logic of certainty. The latter failure dissolves, in the logic of certainty, the much - discussed tension between modus ponens and the law of import-export. (shrink)

I explore the logic of the conditional, using credence judgments to argue against Duality and in favor of Conditional Excluded Middle. I then explore how to give a theory of the conditional which validates the latter and not the former, developing a variant on Kratzer (1981)'s restrictor theory, as well as a proposal which combines Stalnaker (1968)'s theory of the conditional with the theory of epistemic modals I develop in Mandelkern 2019a. I argue that the latter approach fits naturally with (...) a conception of conditionals as referential devices which allow us to talk about particular worlds. (shrink)

ABSTRACT A trivalent theory of indicative conditionals automatically enforces Stalnaker's thesis – the equation between probabilities of conditionals and conditional probabilities. This result holds because the trivalent semantics requires, for principled reasons, a modification of the ratio definition of conditional probability in order to accommodate the possibility of undefinedness. I explain how this modification is motivated and how it allows the trivalent semantics to avoid a number of well-known triviality results, in the process clarifying why these results hold for many (...) bivalent theories. In short, the slew of triviality results published in the last 40-odd years need not be viewed as an argument against Stalnaker's thesis: it can be construed instead as an argument for abandoning the bivalent requirement that indicative conditionals somehow be assigned a truth-value in worlds in which their antecedents are false. (shrink)

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 (...) philosophy”—to adapt Wigner’s phrase—is analogous to that of mathematical explanations in science. As success-criteria for mathematical philosophy, we propose that it should be correct, responsive, illuminating, promising, relevant, and adequate. (shrink)

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 (...) show that there is no conditional operator that has all the properties native speaker intuitions suggest if has. Indicative conditionals have famously been the source of one such tension, ever since the triviality proofs of both Lewis (1976) and Gibbard (1981) established conclusions which are in prima facie tension with ordinary judgments about natural language indicative conditionals. In a recent series of papers, Branden Fitelson has strengthened both triviality results (Fitelson 2013, 2015, 2016), revealing a common culprit: a logical schema known as IMPORT-EXPORT. Fitelson’s results focus the tension between the logical results and ordinary judgments, since IMPORT-EXPORT seems to be supported by intuitions about natural language. In this paper, we argue that the intuitions which have been taken to support IMPORT-EXPORT are really evidence for a closely related, but subtly different, principle. We show that the two principles are independent by showing how, given a standard assumption about the conditional operator in the formal language in which IMPORT-EXPORT is stated, many existing theories of indicative conditionals validate one, but not the other. Moreover, we argue that once we clearly distinguish these principles, we can use propositional anaphora to show that IMPORT-EXPORT is in fact not valid for natural language indicative conditionals (given this assumption about the formal conditional operator). This gives us a principled and independently motivated way of rejecting a crucial premise in many triviality results, while still making sense of the speaker intuitions which appeared to motivate that premise. We suggest that this strategy has broad application and an important lesson: in theorizing about the logic of natural language, we must pay careful attention to the translation between the formal languages in which logical results are typically proved, and natural languages which are the subject matter of semantic theory. (shrink)

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 (...) sometimes fails, and motivate my own theory. On my theory, the proposition expressed by an indicative conditional is partially determined by a background partition, and hence its probability depends on the choice of such a partition. I hold that this background partition is contextually determined, and in certain conditions is set by a salient question under discussion in the context. I show how the resulting theory offers compelling answers to the puzzling questions raised by failures of the Ramseyan thesis. (shrink)

The rise of causality and the attendant graph-theoretic modeling tools in the study of counterfactual reasoning has had resounding effects in many areas of cognitive science, but it has thus far not permeated the mainstream in linguistic theory to a comparable degree. In this study I show that a version of the predominant framework for the formal semantic analysis of conditionals, Kratzer-style premise semantics, allows for a straightforward implementation of the crucial ideas and insights of Pearl-style causal networks. I spell (...) out the details of such an implementation, focusing especially on the notions of intervention on a network and backtracking interpretations of counterfactuals. (shrink)

Conditionals with conditional constituents pose challenges for _the Thesis_, the idea that the probability of a conditional is the corresponding conditional probability. This note is concerned with two proposals for overcoming those challenges, both inspired by early work of van Fraassen: the _Bernoulli Semantics_ associated with Stalnaker and Jeffrey, and augmented with a mechanism for obtaining “local probabilities” by Kaufmann; and a proposal by Bacon which I dub _Ordinal Semantics_. Despite differences in mathematical details and emphasis of presentation, both proposals (...) lend themselves for use as a basis for a modal-theoretic interpretation of embedded conditionals. The goal of this note is to compare the two frameworks by implementing a model for the interpretation of conditionals in each, based on the same underlying probability model for non-conditional sentences. I show that in the Ordinal model, certain sentences are assigned probabilities that do not accord with intuitions. This problem is familiar from the literature on Bernoulli models and can be addressed by introducing Kaufmann-style local probabilities into Ordinal models. I then show that Bernoulli Semantics has other limitations, in that it assigns probabilities in violation of the Thesis to certain very complex formulas. The upshot is that a fusion of the theories may be our best shot at getting the predictions right. (shrink)

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 probabihty/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 counterfactual (...) Ramsey Test makes counterfactuals subject to the very argument that Lewis used to argue against the indicative version of the Ramsey Test. I compare the assumptions needed to run each, pointing to assumptions about the time-evolution of chances that can replace the appeal to Bayesian assumptions about credence update in motivating the assumptions of the argument.I finish by outlining two reactions to the discussion: to indicativize the debate on counterfactuals; or to counterfactualize the debate on indicatives. (shrink)

Adams’ thesis is generally agreed to be linguistically compelling for simple conditionals with factual antecedent and consequent. We propose a derivation of Adams’ thesis from the Lewis- Kratzer analysis of if-clauses as domain restrictors, applied to probability operators. We argue that Lewis’s triviality result may be seen as a result of inexpressibility of the kind familiar in generalized quantifier theory. Some implications of the Lewis- Kratzer analysis are presented concerning the assignment of probabilities to compounds of conditionals.

In this paper we consider conditional random quantities (c.r.q.’s) in the setting of coherence. Based on betting scheme, a c.r.q. X|H is not looked at as a restriction but, in a more extended way, as \({XH + \mathbb{P}(X|H)H^c}\) ; in particular (the indicator of) a conditional event E|H is looked at as EH + P(E|H)H c . This extended notion of c.r.q. allows algebraic developments among c.r.q.’s even if the conditioning events are different; then, for instance, we can give a (...) meaning to the sum X|H + Y|K and we can define the iterated c.r.q. (X|H)|K. We analyze the conjunction of two conditional events, introduced by the authors in a recent work, in the setting of coherence. We show that the conjoined conditional is a conditional random quantity, which may be a conditional event when there are logical dependencies. Moreover, we introduce the negation of the conjunction and by applying De Morgan’s Law we obtain the disjoined conditional. Finally, we give the lower and upper bounds for the conjunction and disjunction of two conditional events, by showing that the usual probabilistic properties continue to hold. (shrink)

Recent work on the interpretation of counterfactual conditionals has paid much attention to the role of causal independencies. One influential idea from the theory of Causal Bayesian Networks is that counterfactual assumptions are made by intervention on variables, leaving all of their causal non-descendants unaffected. But intervention is not applicable across the board. For instance, backtracking counterfactuals, which involve reasoning from effects to causes, cannot proceed by intervention in the strict sense, for otherwise they would be equivalent to their consequents. (...) We discuss these and similar cases, focusing on two factors which play a role in determining whether and which causal parents of the manipulated variable are affected: Speakers' need for an explanation of the hypothesized state of affairs, and differences in the ‘resilience’ of beliefs that are independent of degrees of certainty. We describe the relevant theoretical notions in some detail and provide experimental evidence that these factors do indeed affect speakers' interpretation of counterfactuals. (shrink)

Statements about the future are central in everyday conversation and reasoning. How should we understand their meaning? The received view among philosophers treats will as a tense: in ‘Cynthia will pass her exam’, will shifts the reference time forward. Linguists, however, have produced substantial evidence for the view that will is a modal, on a par with must and would. The different accounts are designed to satisfy different theoretical constraints, apparently pulling in opposite directions. We show that these constraints are (...) jointly satisfied by a novel modal account of will. On this account, will is a modal but doesn't work as a quantifier over worlds. Rather, the meaning of will involves a selection function similar to the one used by Stalnaker in his semantics for conditionals. The resulting theory yields a plausible semantics and logic for will and vindicates our intuitive views about the attitudes that rational agents should have towards future-directed contents. (shrink)

This paper calls for a re-appraisal of McGee's analysis of the semantics, logic and probabilities of indicative conditionals presented in his 1989 paper Conditional probabilities and compounds of conditionals. The probabilistic measures introduced by McGee are given a new axiomatisation built on the principle that the antecedent of a conditional is probabilistically independent of the conditional and a more transparent method of constructing such measures is provided. McGee's Dutch book argument is restructured to more clearly reveal that it introduces a (...) novel contribution to the epistemology of semantic indeterminacy, and shows that its more controversial implications are unavoidable if we want to maintain the Ramsey Test along with the standard laws of probability. Importantly, it is shown that the counterexamples that have been levelled at McGee's analysis|generating a rather wide consensus that it yields `unintuitive' or `wrong' probabilities for compounds |fail to strike at their intended target; for to honour the intuitions of the counterexamples one must either give up the Ramsey Test or the standard laws of probability. It will be argued that we need to give up neither if we take the counterexamples as further evidence that the indicative conditional sometimes allows for a non-epistemic `causal' interpretation alongside its usual epistemic interpretation. (shrink)

A globally expressivist analysis of the indicative conditional based on the Ramsey Test is presented. The analysis is a form of ‘global’ expressivism in that it supplies acceptance and rejection conditions for all the sentence forming connectives of propositional logic (negation, disjunction, etc.) and so allows the conditional to embed in arbitrarily complex sentences (thus avoiding the Frege–Geach problem). The expressivist framework is semantically characterized in a restrictor semantics due to Vann McGee, and is completely axiomatized in a logic dubbed (...) ICL (‘Indicative Conditional Logic’). The expressivist framework extends the AGM (after Alchourron, Gärdenfors, Makinson) framework for belief revision and so provides a categorical (‘yes’–‘no’) epistemology for conditionals that complements McGee’s probabilistic framework while drawing on the same semantics. The result is an account of the semantics and acceptability conditions of the indicative conditional that fits well with the linguistic data (as pooled by linguists and from psychological experiments) while integrating both expressivist and semanticist perspectives. (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)

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)

A compelling, and popular, thought is that ability entails control: S’s being able to φ entails that φ be, in some sense, in S’s control. But this intuition is inconsistent with a different prima facie compelling thought: that S’s succeeding in φ-ing entails that S is able to φ. In this paper, I introduce a new form of evidence to help adjudicate between these two theses: namely, probability judgments about ability ascriptions. I argue that these judgments provide evidence in favor (...) of the intuition that success entails ability, and against the intuition that ability requires control. Moreover, I argue that these judgments support one particular analysis which vindicates the success intuition, namely, the analysis of ability in terms of conditionals. (shrink)

Starting from a recent paper by S. Kaufmann, we introduce a notion of conjunction of two conditional events and then we analyze it in the setting of coherence. We give a representation of the conjoined conditional and we show that this new object is a conditional random quantity, whose set of possible values normally contains the probabilities assessed for the two conditional events. We examine some cases of logical dependencies, where the conjunction is a conditional event; moreover, we give the (...) lower and upper bounds on the conjunction. We also examine an apparent paradox concerning stochastic independence which can actually be explained in terms of uncorrelation. We briefly introduce the notions of disjunction and iterated conditioning and we show that the usual probabilistic properties still hold. (shrink)

It is commonly believed that the role of context cannot be ignored in the analysis of conditionals, and counterfactuals in particular. On truth conditional accounts involving possible worlds semantics, conditionals have been analysed as expressions of relative necessity: “If A, then B” is true at some world w if B is true at all the A-worlds deemed relevant to the evaluation of the conditional at w. A drawback of this approach is that for the evaluation of conditionals with the same (...) antecedents at some world, the same worlds are deemed as relevant for all occasions of utterance. But surely this is inadequate, if shifts of contexts between occasions are to be accounted for. Both the linguistic and logical implications of this defect are discussed, and in order to overcome it a modification of David Lewis’ ordering semantics for counterfactuals is developed for a modified language. I follow Lewis by letting contexts determine comparative similarity assignments, and show that the addition of syntactic context parameters (context indices) to the language gives the freedom required to switch between sets of relevant antecedent worlds from occasion to occasion by choosing the corresponding similarity assignment accordingly. Thus an account that extends Lewis’ analysis of a language containing a single counterfactual connective > to a language containing infinitely many counterfactual connectives >_c, each indexed by a different context name c, overcomes the limitations of traditional analyses. Finally it is also shown that these traditional accounts can be recovered from the modified account if certain contextual restrictions are in place. -/- . (shrink)

In my article, I present a new version of a probabilistic truth prescribing semantics for natural language indicative conditionals. The proposed truth conditions can be paraphrased as follows: an indicative conditional is true if the corresponding conditional probability is high and the antecedent is positively probabilistically relevant for the consequent or the probability of the antecedent of the conditional equals 0. In the paper, the truth conditions are defended and some of the logical properties of the proposed semantics are described.

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)

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)