The visually distinct configurations of k sets

Two sets of sets, C₀ and C₁, are said to be visually equivalent if there is a 1-1 mapping m from C₀ onto C₁ such that for every S, T?C₀, S ∩ T=0 if and only if m(S)∩ m(T)=0 and S?T if and only if m(S)?m(T). We find estimates for V(k), the number of equivalence classes of this relation on sets of k sets, for finite and infinite k. Our main results are that for finite k, $\text{1}\text{2}\text{k}{}^2\text{-k log k <log V (k)<ak}{}^2\text{+βk+log k}$, where α and β are approximately 0.7255 and 2.5323 respectively, and there is a set N of cardinality $\text{1}\text{2}\text{(k}{}^2\text{+k)}$ such that there are V(k) visually distinct sets of k subsets of N.