Find the power set $P(S)$ for $S=\{\emptyset, \{\emptyset\}, \{\emptyset \{\emptyset\}\}\}$ Find the power set $P(S)$ for $S=\{\emptyset, \{\emptyset\}, \{\emptyset \{\emptyset\}\}\}$
OK this problem confuses me for many reasons, but here is what I know.  The cardinality of a set is $2^n$ where $n$ is the number of elements in the set.  In this problem, however, how can the empty set be an element?  
If I were just going to say this set has $2^n$ elements that would mean the set has $2^3$ or 8 elements, but I don't know what those elements would be other than empty sets.
Any help in understanding this problem is greatly appreciated!

Every set has the empty set as an element. However #(S) should be zero where #(S) is the cardinality of set S. 
The power set of the empty set or sets of empty sets should be simply the empty set.
Remember however that the power set of a set is not a cardinality. It is a set constructor that builds a set from the elements of set S. So technically your answer should be the set which is the factorial combination of each element ie if set S = { a, b, c} then P(S) = {a, b, c, {a,b}, {a,c}, {b, c}, {a, b, c} }
IMHO of course !
