Skip Navigation



Journal of Logic and Computation Advance Access published online on June 16, 2009
Journal of Logic and Computation, doi:10.1093/logcom/exp031
This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Zhou, C.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2009. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Original Papers

A Complete Deductive System for Probability Logic1

Chunlai Zhou

State Key Lab of Intelligent Systems and Technology, Tsinghua National Lab for Information Science and Technology, Department of Computer Science and Technology, Tsinghua University, Beijing, 100084, China.
E-mail: czhou{at}tsinghua.edu.cn

Received 4 December 2007.

In this article, we provide a complete deductive system {Sigma}+ for probability logic that is different from the systems by Fagin and Halpern and by Heifetz and Mongin in the literature. The most important principle of the axiomatization is an infinitary Archimedean rule (ARCH). Our proof of the completeness of {Sigma}+ is in keeping with the Kripke-style proof of completeness in modal logic. With the Fourier–Motzkin elimination method, we show both the decidability and Moss's conjecture that the rule (ARCH) is essentially finitary. The perspective of this article is mainly logical. At the end, we point to some further research continuing this piece of work from a coalgebraic perspective.

Keywords: Knowledge and belief; probability logic; modal logic; coalgebras

1This research is partially supported by NSF of China (Grant No: 60736011) and by the Chinese Postdoctoral Foundation (Grant No: 023220030).



References

  1. Aliprantis C, Border K. Infinite Dimension Analysis (2006) 3rd edn. A Hitchhiker's Guide. Springer.
  2. Aumann R. Agreeing to disagree. Annals of Statistics (1976) 4:1236–1239.[CrossRef][Web of Science][Medline]
  3. Aumann R. Interactive epistemology: Knowledge. International journal of Game Theory (1999) 28:263–300.[CrossRef][Web of Science]
  4. Aumann R. Interactive epistemology: Probability. International journal of Game Theory (1999) 28:301–314.[CrossRef][Web of Science]
  5. Blackburn P, de Rijke M, Venema Y. Modal Logic (2000) Oxford University Press. Cambridge Tracts in Theoretical Computer Science, 53.
  6. Cîrstea C, Pattinson D. Modular construction of modal logics. In: CONCUR—Gardner P, Yoshida N, eds. (2004) 258–275. vol. 3170 of Lecture Notes in Computer Science.
  7. Desharnais J, Edalat A, Panangaden P. Bisimulation for labeled markov processes. Information and Computation (2002) 179:163–193.[CrossRef][Web of Science]
  8. Doberkat EE. The Hennessy milner equivalence for continuous time stochastic logic with mu-operator. Journal of Applied Logic (2006) 5:519–544.[CrossRef]
  9. Doberkat EE. Stochastic relations: congruence, bisimulations and the hennessy-milner theorem. SIAM Journal of Computing (2006) 35:590–626.[CrossRef]
  10. Doberkat EE. Stochastic coalgebriac logic: Bisimularity and beviorial equivalence. Annals of Pure and Applied Logic (2008) 155:46–68.[CrossRef][Web of Science]
  11. Doberkat EE, Schubert C. Coalgebraic logic for stochastic right coalgebras. draft available at http://ls10-www.cs.uni-dortmund.de.
  12. Fagin R, Halpern J. Reasoning about knowledge and probability. Journal of ACM (1994) 41:340–367.[CrossRef]
  13. Fagin R, Megiddo N, Halpern J. A logic for reasoning about probabilities. Information and Computation (1990) 87:78–128.[CrossRef][Web of Science]
  14. Goldblatt R. Deduction systems for coalgebras over measurable spaces. Journal of Logic and Computation (2008) 12:1–32.[CrossRef]
  15. Harsanyi J. Games with incomplete information played by Bayesian players, part one. Management Science (1967) 14:159–182.[CrossRef]
  16. Heifetz A. The Bayesian formulation of incomplete information - the non-compact case. International Journal of Game Theory (1993) 21:329–338.[CrossRef][Web of Science]
  17. Heifetz A, Mongin P. Probability logic for type spaces. Games and Economic Behavior (2001) 35:31–53.[CrossRef][Web of Science]
  18. Hintikka J. Knowledge and Belief (1962) Cornell University Press.
  19. Jacobs B. Many-sorted coalgebraic modal logic: a model-theoretic study. ITA (2001) 35:31–59.
  20. Kozen D. A probabilistic pdl. Journal of Computer and System Sciences (1985) 30:162–178.[CrossRef][Web of Science]
  21. Kripke S. A completeness theorem in modal logic. Journal of Symbolic Logic (1959) 24:1–14.[CrossRef]
  22. Larsen KG, Skou A. Bisimulation through probabilistic testing. Information and Computation (1991) 94:1–28.[CrossRef][Web of Science]
  23. Meier M. An infinitary probability logic for type spaces. Israel Journal of Mathematics (2009) 2001/61.
  24. Mertens J, Zamir S. Formulation of Bayesian analysis for games with incomplete information. Internation Journal of Game Theory (1985) 14:1–29.[CrossRef]
  25. Mislove M, Ouaknine J, Pavlovic D, Worrell J. Duality for labelled Markov processes. In: FoSSaCS—Walukiewicz I, ed. (2004) 393–407. vol. 2987 of Lecture Notes in Computer Science.
  26. Moss L. Coalgebraic logic. Annals of Pure Applied Logic (1999) 96:277–317.[CrossRef]
  27. Moss L, Viglizzo I. Final coalgebras for functors on measurable spaces. Information and Computation (2006) 204:610–636.[CrossRef][Web of Science]
  28. Samet D. Quantified beliefs and believed quantities. Journal of Economic Theory (2000) 95:169–185.[CrossRef][Web of Science]
  29. Schrijver A. Theory of Linear and Integer Progamming (1986) JohnWiley & Sons. Wiley-Interscience Series in Discrete Mathematics.
  30. van Benthem J. Exploring Logical Dynamics (1996) CSLI Publications. Studies in Logic, Language and Information.
  31. Venema Y. Automata and fixed point logic: A coalgebraic perspective. Information and Computation (2006) 204:637–678.[CrossRef][Web of Science]
  32. Venema Y. Algebras and co-algebras. In: Handbook of Modal Logic—Blackburn P, van Benthem J, Wolter F, eds. (2007) Studies in Logic and Practical Reasoning. 331–426.
  33. Zhou C. Complete Deductive Systems for Probability Logic with Application in Harsanyi Type spaces (2007) Bloomington: Indiana University. PhD Thesis.
  34. Zhou C. Probability logics for finitely additive beliefs. Journal of Logic, Language and Information (2009).

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?



This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Zhou, C.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?