科研之友
微信
新浪微博
Facebook
分享链接
摘要
We investigate a first-order conditional probability logic with equality, which is, up to our knowledge, the first treatise of such logic. The logic, denoted LFPOIC=, allows making statements such as: CP >= s(phi, theta), and CP <= s(phi, theta), with the intended meaning that the conditional probability of phi given theta is at least (at most) s. The corresponding syntax, semantic, and axiomatic system are introduced, and Extended completeness theorem is proven.
- 出版日期2013
