On Boolean algebra and its importance for the computer sciences

Authors

  • Per-Olov Löwdin

    1. Quantum Theory Project, Departments of Chemistry and Physics, 362 Williamson Hall, University of Florida, Gainesville, Florida 32611
    Search for more papers by this author
    • Professor Emeritus at Uppsala University, Uppsala, Sweden.


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.

Ancillary