Conjunction, disjunction and iterated conditioning of conditional events

28Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Gilio, A., & Sanfilippo, G. (2013). Conjunction, disjunction and iterated conditioning of conditional events. In Advances in Intelligent Systems and Computing (Vol. 190 AISC, pp. 399–407). Springer Verlag. https://doi.org/10.1007/978-3-642-33042-1_43

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free