The principle of inclusion–exclusion is one of the most important principles of enumeration. This chapter states and proves this principle and provides applications to enumerative combinatorics (enumeration of surjective maps, permutations without fixed points and rook placements, proofs of combinatorial identities) and to elementary number theory.