# Name for concept: each pair of sets is either nested or disjoint

Does this property have a name?

Given a collection of sets $\mathcal{P}$, for all pairs $A, B\in\mathcal{P}$, either $A\cap B=\emptyset$ or $A\subseteq B$ or $B\subseteq A$.

This concept could equally apply to monoids, groups, partial orders or other mathematical structures, with some adjustments to the definitions. For instance, for monoids and groups we would replace $A\cap B=\emptyset$ by $A\cap B=\{\epsilon\}$, where $\epsilon$ is the unit of the monoid/group.

• Embarassing: I asked the same question before. – Dave Clarke Sep 12 '13 at 10:10
• In the light of our recent discussion, I think I have to ask: what is the relation to CS here, that is which concept are you trying to model? – Raphael Sep 16 '13 at 7:24
• @Raphael: The concept came up while investigating models of software product lines. I distilled the essence, and chose more basic mathematical structures as the basis of the question. Had I included all the details about software product lines in order to phrase the question, ... well, it wouldn't have been so easy to get a clear answer so quickly. – Dave Clarke Sep 16 '13 at 10:53