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 Full Text (PDF)
Right arrow References
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.


   Abstract

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).


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




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.