An OR gate outputs 1 when at least one input is 1. It outputs 0 only when every input is 0. For two inputs it is written and read "A or B".
Picture two switches wired side by side, each giving current its own path to a lamp. The lamp lights if either switch is closed, or both. That gives OR's truth table: a single 0, in row 00.
OR is inclusive: "at least one" includes "both". So with A = 1 and B = 1 the output is 1. The gate that leaves out the both-1 case is XOR, and confusing the two is one of the most common slips in the course.
The + sign is borrowed from arithmetic, but it doesn't add. There is no 2 and no carry: 1 + 1 = 1.
The symbol has a curved back, where the inputs enter, and a pointed front.
As a control, OR is the mirror image of AND:
- A 0 on one input lets the other through: = A.
- A 1 on one input forces the output to 1: = 1.
OR gates form the second level of every sum of products circuit, and inverting the output gives NOR.