SearcharxivSearch

arXiv · 1109.6402

Extension of Boolean algebra by a Bayesian operator; application to the definition of a Deterministic Bayesian Logic

Abstract

This work contributes to the domains of Boolean algebra and of Bayesian probability, by proposing an algebraic extension of Boolean algebras, which implements an operator for the Bayesian conditional inference and is closed under this operator. It is known since the work of Lewis (Lewis' triviality) that it is not possible to construct such conditional operator within the space of events. Nevertheless, this work proposes an answer which complements Lewis' triviality, by the construction of a conditional operator outside the space of events, thus resulting in an algebraic extension. In particular, it is proved that any probability defined on a Boolean algebra may be extended to its algebraic extension in compliance with the multiplicative definition of the conditional probability. In the last part of this paper, a new bivalent logic is introduced on the basis of this algebraic extension, and basic properties are derived.

Explore related subjects

Keep this discovery

BibTeXRIS

Frederic Dambreville. 2011-12-15. Extension of Boolean algebra by a Bayesian operator; application to the definition of a Deterministic Bayesian Logic. https://arxiv.org/abs/1109.6402

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO