Journal of Logic, Language and Information

, Volume 19, Issue 3, pp 247–282

Probability Logic of Finitely Additive Beliefs

Article

DOI: 10.1007/s10849-009-9100-2

Cite this article as:
Zhou, C. J of Log Lang and Inf (2010) 19: 247. doi:10.1007/s10849-009-9100-2
  • 115 Views

Abstract

Probability logics have been an active topic of investigation of beliefs in type spaces in game theoretical economics. Beliefs are expressed as subjective probability measures. Savage’s postulates in decision theory imply that subjective probability measures are not necessarily countably additive but finitely additive. In this paper, we formulate a probability logic Σ+ that is strongly complete with respect to this class of type spaces with finitely additive probability measures, i.e. a set of formulas is consistent in Σ+ iff it is satisfied in a finitely additive type space. Although we can characterize Σ+-theories satisfiable in the class as maximally consistent sets of formulas, we prove that any canonical model of maximally consistent sets is not universal in the class of type spaces with finitely additive measures, and, moreover, it is not a type space. At the end of this paper, we show that even a minimal use of probability indices causes the failure of compactness in probability logics.

Keywords

Probabilistic beliefsType spacesReasoning about probabilitiesModal logic

Copyright information

© Springer Science+Business Media B.V. 2009

Authors and Affiliations

  1. 1.State Key Laboratory of Intelligent Technology and Systems, Tsinghua National Lab for Information Science and Technology, Department of Computer Science and TechnologyTsinghua UniversityBeijingChina