From Boolean Logic & Logic Gates: Crash Course Computer Science #3 3/8/2017 | 10m 1sVideo has Closed Captions| CC We’re going to focus on three fundamental operations - NOT, AND, and OR.

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) ...