Abstract

We offer a variant of the intrinsic definition of compatibility in logics. We shown that any compatible subset can be embedded into a Boolean σ-algebra, we show how the algebra is constructed, and we demonstrate that our definition cannot be weakened unless we put additional assumptions on the logic