On lexicographic probability relations (Q1072417)

The paper examines conditions under which a probability relation on a set of events is lexicographic. A probability relation is called lexicographic if there is an event A such that events are ordered lexicographically by their intervections with A and ''not A''. The main result of the paper is that for tight probability relations, if in one of the maximal chains of events with probability zero there exists a maximal event (containing all the events of this chain), then the probability relation is lexicographic.