The aim of the paper is to draw a connection between a semantical theory of conditional statements and the theory of conditional probability. First, the probability calculus is interpreted as a semantics for truth functional logic. Absolute probabilities are treated as degrees of rational belief. Conditional probabilities are explicitly defined in terms of absolute probabilities in the familiar way. Second, the probability calculus is extended in order to provide an interpretation for counterfactual probabilities--conditional probabilities where the condition has zero probability. (...) Third, conditional propositions are introduced as propositions whose absolute probability is equal to the conditional probability of the consequent on the antecedent. An axiom system for this conditional connective is recovered from the probabilistic definition. Finally, the primary semantics for this axiom system, presented elsewhere, is related to the probabilistic interpretation. (shrink)

This paper sheds new light on the subtle relation between probability and logic by (i) providing a logical development of Bruno de Finetti's conception of events and (ii) suggesting that the subjective nature of de Finetti's interpretation of probability emerges in a clearer form against such a logical background. By making explicit the epistemic structure which underlies what we call Choice-based probability we show that whilst all rational degrees of belief must be probabilities, the converse doesn't hold: some probability values (...) don't represent decision-relevant quantifications of uncertainty. (shrink)

There are several approaches implementing reasoning based on conditional knowledge bases, one of the most popular being System Z (Pearl, Proceedings of the 3rd conference on theoretical aspects of reasoning about knowledge, TARK ’90, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, pp. 121–135, 1990). We look at ranking functions (Spohn, The Laws of Belief: Ranking Theory and Its Philosophical Applications, Oxford University Press, Oxford, 2012) in general, conditional structures and c-representations (Kern-Isberner, Conditionals in Nonmonotonic Reasoning and Belief Revision: Considering (...) Conditionals as Agents, vol. 2087 of LNCS, Springer, Berlin, 2001) in order to examine the reasoning strength of the different approaches by learning which of the known calculi of nonmonotonic reasoning (System P and R) and Direct Inference are applicable to these inference relations. Furthermore we use the recently proposed Enforcement-postulate (Kern-Isberner and Krümpelmann, Proceedings of the 22nd international joint conference on artificial intelligence, vol. 2, IJCAI’11, AAAI Press, pp. 937–942, 2011) to show dependencies between these approaches. (shrink)

The standard use of the propositional calculus ('P.C.?) in analyzing the validity of inferences involving conditionals leads to fallacies, and the problem is to determine where P.C. may be ?safely? used. An alternative analysis of criteria of reasonableness of inferences in terms of conditions of justification rather than truth of statements is proposed. It is argued, under certain restrictions, that P. C. may be safely used, except in inferences whose conclusions are conditionals whose antecedents are incompatible with the premises in (...) the sense that if the antecedent became known, some of the previously asserted premises would have to be withdrawn. (shrink)

We discuss similarities and residual differences, within the general semantic framework of minimality, between defeasible inference, belief revision, counterfactual conditionals, updating — and also conditional obligation in deontic logic. Our purpose is not to establish new results, but to bring together existing material to form a clear overall picture.

This paper analyzes concepts of independence and assumptions of convexity in the theory of sets of probability distributions. The starting point is Kyburg and Pittarelli’s discussion of “convex Bayesianism” (in particular their proposals concerning E-admissibility, independence, and convexity). The paper offers an organized review of the literature on independence for sets of probability distributions; new results on graphoid properties and on the justification of “strong independence” (using exchangeability) are presented. Finally, the connection between Kyburg and Pittarelli’s results and recent developments (...) on the axiomatization of non-binary preferences, and its impact on “complete” independence, are described. (shrink)

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 (...) indicatives and relies on the notion of causal (in)dependence. (shrink)

Betting methods, of which de Finetti's Dutch Book is by far the most well-known, are uncertainty modelling devices which accomplish a twofold aim. Whilst providing an interpretation of the relevant measure of uncertainty, they also provide a formal definition of coherence. The main purpose of this paper is to put forward a betting method for belief functions on MV-algebras of many-valued events which allows us to isolate the corresponding coherence criterion, which we term coherence in the aggregate. Our framework generalises (...) the classical Dutch Book method. (shrink)