A conditional event algebra is an algebraic structure whose domain consists of logical objects described by statements of forms such as "If A, then B", "B, given A", and "B, in case A". Unlike the standard Boolean algebra of events, a CEA allows the defining of a probability function, P, which satisfies the equation P = P / P over a usefully broad range of conditions.
In standard probability theory, one begins with a set, Ω, of outcomes and a set, F, of some subsets of Ω, such that F is closed under the countably infinite versions of the operations of basic set theory: union, intersection, and complementation. A member of F is called an event, and F, the set of events, is the domain of the algebra. Ω is, necessarily, a member of F, namely the trivial event "Some outcome occurs." A probability function P assigns to each member of F a real number, in such a way as to satisfy the following axioms: It follows that P is always less than or equal to 1. The probability function is the basis for statements like P = 0.73, which means, "The probability that A but not B is 73%."
The statement "The probability that if A, then B, is 24%." means that event B occurs in 24% of the outcomes where event A occurs. The standard formal expression of this is P = 0.24, where the conditional probabilityP equals, by definition, P / P. It is tempting to write, instead, P = 0.24, where A → B is the conditional event "If A, then B". That is, given events A and B, one might posit an event, A → B, such that P could be counted on to equal P. One benefit of being able to refer to conditional events would be the opportunity to nest conditional event descriptions within larger constructions. Then, for instance, one could write P = 0.51, meaning, "The probability that either A, or else if B, then C, is 51%". Unfortunately, philosopher David Lewis showed that in orthodox probability theory, only certain trivial Boolean algebras with very few elements contain, for any given A and B, an event X such that P = P is true for any probability function P. Later extended by others, this result stands as a major obstacle to any talk about logical objects that can be the bearers of conditional probabilities.
The construction of conditional event algebras
The classification of an algebra makes no reference to the nature of the objects in the domain, being entirely a matter of the formal behavior of the operations on the domain. However, investigation of the properties of an algebra often proceeds by assuming the objects to have a particular character. Thus, the canonical Boolean algebra is, as described above, an algebra of subsets of a universe set. What Lewis in effect showed is what can and cannot be done with an algebra whose members behave like members of such a set of subsets. Conditional event algebras circumvent the obstacle identified by Lewis by using a nonstandard domain of objects. Instead of being members of a set F of subsets of some universe set Ω, the canonical objects are normally higher-level constructions of members of F. The most natural construction, and historically the first, uses ordered pairs of members of F. Other constructions use sets of members of F or infinite sequences of members of F. Specific types of CEA include the following : CEAs differ in their formal properties, so that they cannot be considered a single, axiomatically characterized class of algebra. Goodman-Nguyen-van Frassen algebras, for example, are Boolean while Calabrese algebras are non-distributive. The latter, however, support the intuitively appealing identity A → = → C, while the former do not.
