Abstract
We examine several concepts of independence associated with (1) credal sets, understood as sets of probability measures, (2) sets of full conditional probabilities, (3) sets of lexicographic probabilities, and (4) sets of desirable gambles. Concepts of independence are evaluated with respect to the graphoid properties they satisfy, as these properties capture important abstract features of “independence”. We emphasize the analysis of sets of probability measures as this is a popular formalism, looking at versions of epistemic, confirmational, and type-5 independence that are based on regular conditioning, as well as complete and strong independence. We then examine analogous concepts of independence for sets of full conditional probabilities, sets of lexicographic probabilities, and sets of desirable gambles.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
