# Disjunction > [!NOTE] Logical Disjunction > The **disjunction** or **OR** of a set of operands is true if *any* of its operands are true. > $X\vee Y$ > > | $X$ | $Y$ | $X\vee Y$ | | :---: | :---: | :-----------: | | $0$ | $0$ | $0$ | | $0$ | $1$ | $1$ | | $1$ | $0$ | $1$ | | $1$ | $1$ | $1$ | > Disjunction is analogous to the [[union]] of sets. The corresponding logic gate is the *OR gate*. ![[ORGate.svg|200]] ## Notation The symbol for disjunction in formal logic and Boolean algebra is $\vee$. In electronics it is denoted using $+$ instead. In many programming languages either `|` or `||` is used to form a disjunction.