2007/01/28 by F Dambreville, Dambreville, Frederic
Computer Science · #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Multi-Agent Systems and Negotiation #Probability (math.PR) #Semantic Web and Ontologies
paper · doi:10.48550/arxiv.math/0701801
openalex publication_date 2007/01/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper a conditional logic is defined and studied. This conditional logic, DmBL, is constructed as a deterministic counterpart to the Bayesian conditional. The logic is unrestricted, so that any logical operations are allowed. A notion of logical independence is also defined within the logic itself. This logic is shown to be non-trivial and is not reduced to classical propositions. A model is constructed for the logic. Completeness results are proved. It is shown that any unconditioned probability can be extended to the whole logic DmBL. The Bayesian conditional is then recovered from the probabilistic DmBL. At last, it is shown why DmBL is compliant with Lewis' triviality.