On lexicographic probability relations (Q1072417)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On lexicographic probability relations |
scientific article; zbMATH DE number 3941204
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On lexicographic probability relations |
scientific article; zbMATH DE number 3941204 |
Statements
On lexicographic probability relations (English)
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
