Abstract
Replacing the demand of countable additivity (σ-additivity), imposed on probability measures by the classical Kolmogorov axiomatic, by a stronger axiom, and considering only probability measures taking their values in the Cantor subset of the unit interval of real numbers, we obtain such an axiomatic system that each probability measure satisfying these axioms is extensional in the sense that probability values ascribed to measurable unions and intersections of measurable sets are functions of probability values ascribed to particular sets in question. Moreover, each such probability measure can be set into a one-to-one correspondence with a boolean-valued probability measure taking its values in the set of all subsets of an infinite countable space, e.g., the space of all natural numbers.
Preview
Unable to display preview. Download preview PDF.
References
A. Bundy: Incidence calculus — A mechanism for probabilistic reasoning. Journal of Automated Reasoning 1, 1985, no. 3, pp. 263–283.
W. Feller: An Introduction to Probability Theory and its Applications, vol. I, 2nd edition. J. Wiley and Sons, New York, 1957.
A. N. Kolmogorov: Grundbegriffe der Wahrscheinlichkeitsrechnung. Springer-Verlag, Berlin, 1933.
I. Kramosil: Expert systems with non-numerical belief functions. Problems of Control and Information Theory 17 (1988), no. 5, pp. 285–295.
I. Kramosil: Extensional processing of probability measures. International Journal of General Systems 22 (1994), no. 2, pp. 159–170.
M. Loève: Probability Theory. Van Nostrand, Princeton, 1955.
R. Sikorski: Boolean Algebras, second edition. Springer-Verlag, Berlin-Göttingen — Heidelberg — New York, 1964.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kramosil, I. (1995). An axiomatic approach to extensional probability measures. In: Froidevaux, C., Kohlas, J. (eds) Symbolic and Quantitative Approaches to Reasoning and Uncertainty. ECSQARU 1995. Lecture Notes in Computer Science, vol 946. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60112-0_31
Download citation
DOI: https://doi.org/10.1007/3-540-60112-0_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60112-8
Online ISBN: 978-3-540-49438-6
eBook Packages: Springer Book Archive