TY - CHAP
T1 - Conjunction, disjunction and iterated conditioning of conditional events
AU - Sanfilippo, Giuseppe
AU - Gilio, Angelo
PY - 2013
Y1 - 2013
N2 - 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.
AB - 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.
UR - http://hdl.handle.net/10447/66129
M3 - Chapter
SN - 978-3-642-33041-4
T3 - ADVANCES IN INTELLIGENT SYSTEMS AND COMPUTING
SP - 399
EP - 407
BT - Synergies of soft computing and statistics for intelligent data analysis
ER -