F. Wehrung has asked: Given a family $\mathcal{C}$ of subsets of a set $Ω$, under what conditions will there exist a total ordering on $Ω$ under which every member of $\mathcal{C}$ is convex? <p> Note that if $A$ and $B$ are nondisjoint convex subsets of a totally ordered set, neither of which contains the other, then $A\cup B$, $A\cap B$, and $A\setminus B$ are also convex. So let $\mathcal{C}$ be an arbitrary set of subsets of a set $Ω$, and form its closure $\mathcal{P}$ under forming, whenever $A$ and $B$ are nondisjoint and neither contains the other, the sets $A\cup B$, $A\cap B$, and $A\setminus B$. We determine the form $\mathcal{P}$ can take when $\mathcal{C}$, and hence $\mathcal{P}$, is finite, and for this case get necessary and sufficient conditions for there to exist an ordering of $Ω$ of the desired sort. From this we obtain a condition which works without the finiteness hypothesis. <p> We establish bounds on the cardinality of the subset $\mathcal{P}$ generated as above by an $n$-element set $\mathcal{C}$. <p> We note connections with the theory of <i>interval graphs</i> and <i>hypergraphs</i>, which lead to other ways of answering Wehrung's question.