 The coiterative conception of set. AFA gives rise to, or reflects, a conception of set that is at odds with the iterative conception.   For lack of a better name, we call it the coiterative conception.    According to this, a set is an abstract structure obtained by taking a graph G  (a set with a relation  on it), and then associating to each node x in the graph a set in such a way that the set associated to x is the set of sets associated to the children of x in G .    This association is what we called decoration earlier.  This association might be thought of procedurally, but it need not be so construed.   One can instead posit a harmony between decoration and power sets.[9]