Using Boolean algebra as switching algebra, complex circuits are expressed so that they can be evaluated mathematically.

Boolean algebra, as its become known, is the branch of mathematics that operates on values of true or false — usually written as 1 or 0 —to process logical statements. In turn, it’s possible ...

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

These can be represented as truth tables, Boolean algebra logic statements, and diagrams. Part of Computer Science Principles of computer science ...

Wolfgang Lenzen, Leibniz und die Boolesche Algebra, Studia Leibnitiana, Bd. 16, H. 2 (1984), pp. 187-203 ...