Abstract

In literature, different deductive systems are developed for probability logics. But, for formulas, they provide essentially equivalent definitions of consistency. In this paper, we present a guided maximally consistent extension theorem which says that any probability assignment to formulas in a finite local language satisfying some constraints specified by probability formulas is consistent in probability logics, and hence connects this intuitive reasoning with formal reasoning about probabilities. Moreover, we employ this theorem to show two interesting results:

  • The satisfiability of a probability formula is equivalent to the solvability of the corresponding system of linear inequalities through a natural translation based on atoms, not on Hintikka sets;

  • the Countably Additivity Rule in Goldblatt [6] is necessary for his deductive construction of final coalgebras for functors on Meas, the category of measurable spaces.

Keywords

Probability Logic Belief Types Modal Logic Probability Measure 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aumann, R.: Interactive epistemology: Knowledge. Int. J. Game Theory 28, 263–300 (1999)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Aumann, R.: Interactive epistemology: Probability. Int. J. Game Theory 28, 301–314 (1999)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Doberkat, E.E.: Stochastic Coalgebraic Logic. EATCS Mongraphs in Theoretical Computer Sciences. Springer, Heidelberg (2010)MATHGoogle Scholar
  4. 4.
    Fagin, R., Halpern, J.: Reasoning about knowledge and probability. J. ACM 41, 340–367 (1994)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Fagin, R., Megiddo, N., Halpern, J.: A logic for reasoning about probabilities. Inf. and Comp. 87, 78–128 (1990)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Goldblatt, R.: Deduction systems for coalgebras over measurable spaces. J. Logic Comp. 20(5), 1069–1100 (2010)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Heifetz, A., Mongin, P.: Probability logic for type spaces. Games Econom. Behav. 35, 31–53 (2001)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Heifetz, A., Samet, D.: Topology-free typology of beliefs. J. Econom. Theory 82, 241–324 (1998)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Heifetz, A., Samet, D.: Coherent beliefs are not always types. J. Math. Econom. 32, 475–488 (1999)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Meier, M.: An infinitary probability logic for type spaces. Israel J. of Math. (to appear)Google Scholar
  11. 11.
    Moss, L., Viglizzo, I.: Final coalgebras for functors on measurable spaces. Inf. and Comp. 204, 610–636 (2006)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Zhou, C.: A complete deductive system for probability logic. J. Logic Comp. 19(6), 1427–1454 (2009)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Zhou, C.: Probability logics for finitely additive beliefs. J. Logic, Language and Information 19(3), 247–282 (2010)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Chunlai Zhou
    • 1
  1. 1.Department of Computer Science and Technology, School of InformationRenmin University of ChinaBeijingChina

Personalised recommendations