Boolean algebra

Boolean algebra is a branch of algebra that focuses on binary operations within a binary system. It was conceptualized in the mid-nineteenth century by the English mathematician George Boole, from whom it derives its name. Unlike traditional algebra which operates on real numbers, Boolean algebra is centered around binary values: 0 (zero) and 1 (one). These values can also be represented as True (1) or False (0), or alternatively, On (1) and Off (0).

• Propositional logic. Boolean algebra facilitates the evaluation of expressions in an algebraic form based on propositional logic. In this logic, functions yield results that are either zero or one.
• Logical operators. Propositions can be interconnected using logical operators such as AND, OR, and NOT. These operators produce a new proposition with a value of either true or false. Specifically, the primary logical operators in Boolean algebra are AND (logical product), OR (logical sum), and NOT (negation/complement).

A significant application of Boolean algebra is in computer science, given that computer logic is fundamentally based on the binary system. Within the electronic circuits of a computer, information is primarily processed as sequences of zeros and ones.