Disjoint refinement of a set of sets Say I have some set $F$ of sets. This is obviously a cover of $\cup F$. Is there a general algorithm that makes "this" cover disjoint? That is, a set $F'$ of pairwise disjoint sets with the properties $\cup F = \cup F'$ and $(\forall A \in F')(\exists B \in F)(A \subset B)$?
This question covers the countable case.

I can tell you how to prove that such a refinement exists. It's not entirely elementary, and it probably doesn't count as an "algorithm". I don't know how much set theory you know - you can find the required background for what's below by searching Wikipedia for "ordinal", "Well ordering theorem", and "transfinite recursion" (if you don't find that try transfinite induction).
Ok. The well ordering theorem implies that any set is bijective with some ordinal. So there exists an ordinal $\alpha$ and an "enumeration" of $F$, so that we can write $$F=\{S_\beta\,:\,\beta<\alpha\}.$$ Here $\beta<\alpha$ refers to ordinals $\beta$. Now the magic of transfinite recursion shows that there exists a family of sets $S'_\beta$ (for $\beta<\alpha$) such that for every $\beta<\alpha$ we have $$S'_\beta=S_\beta\setminus\bigcup_{\gamma<\beta}S_\gamma.$$Clearly $S'_\beta\subset S_\beta$, clearly the $S'_\beta$ are pariwise disjoint, and it's easy to check by transfinite induction that $$\bigcup_{\beta<\alpha}S'_\beta=\bigcup_{\beta<\alpha}S_\beta.$$(For that last bit: Say $x\in\bigcup_{\beta<\alpha}S_\beta$. Let $\beta$ be the smallest ordinal with $x\in S_\beta$. Then $x\in S'_\beta$.)
This could also be done by Zorn's Lemma. But, once you get past the machinery of ordinals and transfinite recursion, the proof above is much nicer and more intuitive (imo): It's just like the countable case! (Except different, of course...)
