On lexicographic probability relations (Q1072417)

From MaRDI portal
Revision as of 12:07, 17 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On lexicographic probability relations
scientific article

    Statements

    On lexicographic probability relations (English)
    0 references
    0 references
    1986
    0 references
    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.
    0 references
    lexicographic probabiity relation
    0 references
    tight probability relations
    0 references

    Identifiers