Finitistic and frequentistic approximation of probability measures with or without \(\sigma\)-additivity (Q941742): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Extension of relatively σ-additive probabilities on Boolean algebras of logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4162207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3663565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3794956 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5343895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5184183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilities over rich languages, testing and randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Laplacean formal semantics for single-case propensities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223173 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3238703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimally generated Boolean algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5341273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4780774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extent of non-conglomerability of finitely additive probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2736604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Countable Additivity and Subjective Probability / rank
 
Normal rank

Revision as of 14:54, 28 June 2024

scientific article
Language Label Description Also known as
English
Finitistic and frequentistic approximation of probability measures with or without \(\sigma\)-additivity
scientific article

    Statements

    Finitistic and frequentistic approximation of probability measures with or without \(\sigma\)-additivity (English)
    0 references
    2 September 2008
    0 references
    A theory of finitistic and frequentistic approximations (\(f\)-approximations) of probability measures \(P\) over a countably infinite outcome space \(N\) is developed. The family of subsets of \(N\) for which \(f\)-approximations converge to a frequency limit forms a pre-Dynkin system \(D\subset\varphi(N)\). The limiting probability measure over \(D\) can always be extended to a probability measure over \(\varphi(N)\), but this measure is not always \(\sigma\)-additive. It is concluded that probability measures can be regarded as idealizations of limiting frequencies if and only if \(\sigma\)-additivity is not assumed as a necessary axiom for probabilities. It is proved that \(\sigma\)-additive probability measures can be characterized in terms of so-called canonical and in terms of so-called full \(f\)-approximations. It is also shown that every non-\(\sigma\)-additive probability measure is \(f\)-approximable, though neither canonically nor fully \(f\)-approximable. Finally, the obtained results are translated to probability measures on open or closed formulas of first-order languages.
    0 references
    probability
    0 references
    finite additivity
    0 references
    \(\sigma\)-additivity
    0 references
    frequency theory
    0 references
    finitistic approximation
    0 references
    0 references
    0 references

    Identifiers