Truth table for 2-input logic gates (AND, OR, NAND, NOR, XOR, XNOR) with links to Wikipedia and explanations for T (true) and F (false).

Truth table for logic gates.md

Truth table for logic gates ¹

Here is a truth table that gives definitions of each of the 6 possible 2-input logic gate functions of two Boolean variables $P$ and $Q$:

$P$	$Q$	$P$ ∧ $Q$	$P$ ∨ $Q$	$P$ ⊼ $Q$	$P$ ⊽ $Q$	$P$ ⊽ $Q$	$P$ ≣ $Q$
$\text{T}$	$\text{T}$	$\text{T}$	$\text{T}$	$\text{F}$	$\text{F}$	$\text{F}$	$\text{T}$
$\text{T}$	$\text{F}$	$\text{F}$	$\text{T}$	$\text{T}$	$\text{F}$	$\text{T}$	$\text{F}$
$\text{F}$	$\text{T}$	$\text{F}$	$\text{T}$	$\text{T}$	$\text{F}$	$\text{T}$	$\text{F}$
$\text{F}$	$\text{F}$	$\text{F}$	$\text{F}$	$\text{T}$	$\text{T}$	$\text{F}$	$\text{T}$
Name (function)		AND (conjunction)	OR (disjunction)	NAND (non-conjunction)	NOR (non-disjunction)	XOR (non-equivalence)	XNOR (equivalence)

where $\text{T}$ means true and $\text{F}$ means false.

Footnotes

1. Wikipedia ↩