Boolean Logic was formalized by a dude named "Bool". All computers[^1] do **all of their computations** using simple boolean logic. You can build any sort of calculator by combining *logic gates* in particular ways. You can represent combinations of logic using **truth tables**, which are pretty straightforward to read. ![[Boolean Logic 2026-02-05 17.57.24.excalidraw.svg]] %%[[Boolean Logic 2026-02-05 17.57.24.excalidraw.md|🖋 Edit in Excalidraw]]%% ## Boolean Math Statements Boolean statements look like basic math, but are not. `+` = "or" `*` = "and" (bar over letter) = "NOT" that value > [!example] > `AB+C` is "(A AND B) OR C) > `AB+C` truth table: | A | B | C | Output | | --- | --- | --- | ------ | | 0 | 0 | 0 | 0 | | 0 | 0 | 1 | 1 | | 0 | 1 | 0 | 0 | | 0 | 1 | 1 | 1 | | 1 | 0 | 0 | 0 | | 1 | 0 | 1 | 1 | | 1 | 1 | 0 | 1 | | 1 | 1 | 1 | 1 | **** # More ## Source - college [^1]: except quantum computers? I dunno.