Notes by Lex Toumbourou

Boolean algebra is the foundation of computer circuit analysis.

It's based on 3 fundamental operations: AND, OR and NOT.

AND (Boolean Operation) * Also known as logical product. * Represented as $x . y$ or $xy$ (hence logical product) * logical product, intersection or conjunction * represented as x . y, $x \cap y$ or $x \wedge y$. * OR * logical sum, union or disjunction * represented as $x + y$, $x \cup y$, $x \lor y$ * NOT * logical complement or negation * represented as $x'$, $\overline{x}$ or $\neg x$ * When parentheses are not used, orperators have order of prefs: NOT > AND > OR.