# Conjunction > [!NOTE] Logical Conjunction > The **conjunction** or **AND** of a set of operands is true if *all* of its operands are true. > $X\wedge Y$ > > | $X$ | $Y$ | $X\wedge Y$ | |:---:|:---:|:-----------:| | $0$ | $0$ | $0$ | | $0$ | $1$ | $0$ | | $1$ | $0$ | $0$ | | $1$ | $1$ | $1$ | > Conjunction is analogous to the [[intersection]] of sets. The corresponding logic gate is the *AND gate*. ![[ANDGate.svg]] ## Notation The symbol for conjunction is formal logic and Boolean algebra is $\wedge$. In electronics it is denoted with $\times$ or $\cdot$ or without a symbol at all as in $XY=X\wedge Y$. In many programming languages either `&` or `&&` is used to form a conjunction.