On Boolean algebra and its importance for the computer sciences
Per‐Olov Löwdin · International Journal of Quantum Chemistry · 1992
Abstract A brief survey is given of the abstract contentless Boolean algebra and its realizations to logic, class theory, and electric circuits as well as its applications to the software and hardware of the modern electronic computers. It is shown that three relations, 1 + 1 = 1, 1 + 1 = 0, and 1 + 1 = 10, correspond to three different realizations of the algebra, and that they, hence, represent an elementary example of a Gödelian branching point in the abstract Boolean algebra.