P(A) = set of all subsets of A, including empty set and A itself. If |A| = n, then |P(A)| = 2^n. Each element is either in or out of a subset (2 choices per element). The power set of the empty set is {empty set}, which has 1 element = 2^0. P(P(A)) has 2^(2^n) elements.