How many Boolean functions of degree n are self-dual? We define the relation ≤ on the set of Boolean functions of degree n so that F ≤ G, where F and G are Boolean functions if and only if G(x1, x2, . . . , xn) = 1 whenever F(x1, x2, . . . , xn) = 1.