Switching algebra is easily visualized using switches since there are only two values: on and off, or true and false. In digital systems we represent these as 1 and 0, respectively. There are only two ...

It is proved that the following conditions are equivalent: (a) there exists a complete, atomless, σ-centered Boolean algebra, which does not contain any regular, atomless, countable subalgebra, (b) ...