zbMATH — the first resource for mathematics

Completeness theorem for probability models with finitely many valued measure. (English) Zbl 1435.03063
Summary: The aim of the paper is to prove the completeness theorem for probability models with finitely many valued measure.
03C70 Logic on admissible sets
03B48 Probability and inductive logic
03C65 Models of other mathematical theories
60A05 Axioms; other general questions in probability
Full Text: DOI
[1] Barwise J., Admissible sets and Structure, Springer-Verlag, Berlin, Heidelberg, New York, 1975 · Zbl 0215.31806
[2] Bhaskara Rao K.P.S., Bhaskara Rao M., Theory of charge, Academic Press, New York, 1983 · Zbl 0516.28001
[3] Djordjević R., Analitic completeness theorem for absolutely continous biprobability models, Z. Math. Logik Grundlang. Math, 1992, 38, 241-246
[4] Djordjević R., Ikodinović N., Mijajlović Z., Completeness theorem for Topological Class Models, Arch. Math. Logic, 2007, 46, 1-8 · Zbl 1112.03036
[5] Djordjević R., Rašković M., Ognjanović Z., Completeness theorem for propositional probabilistic models whose measure have only finite ranges, Arch. Math. Logic, 2004, 43, 557-563 · Zbl 1057.03028
[6] Hoover D., Probability logic, Annals of Math. Logic, 1978, 14, 287-313 · Zbl 0394.03033
[7] Keisler H. J., Model Theory for Infinitary Logic, North-Holland, Amsterdam, 1971 · Zbl 0222.02064
[8] Keisler H. J., Hyperfinite model theory, Logic Colloquim 76, North-Holland, Amsterdam, 1977, 5-110
[9] Keisler H. J., Probability quantifiers, in: Model Theoretical Logics, Springer Verlag, Berlin Heidelberg New York, 1985, 509-556
[10] Rašković M., Completeness theorem for biprobability models, The Journal of Symbolic Logic, 1986, 51, 586-590 · Zbl 0626.03031
[11] Rašković M., Djordjević R., Probability quantifiers and operators, Vesta, Belgrade, 1996 · Zbl 0933.03044
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.