On lexicographic probability relations (Q1072417): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0165-4896(86)90026-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2075872119 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Subgroups of Free Products with Amalgamated Subgroups: A Topological Approach / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5726943 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5832753 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4403141 / rank | |||
Normal rank | |||
Latest revision as of 12:07, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On lexicographic probability relations |
scientific article |
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
