Is there an existing term for pairs of sets $X, Y$, not necessarily disjoint, such that neither $X \subseteq Y$ nor $Y \subseteq X$?
Would it be incorrect (or misleading) to call them something like "incongruent" sets?
Is there an existing term for pairs of sets $X, Y$, not necessarily disjoint, such that neither $X \subseteq Y$ nor $Y \subseteq X$?
Would it be incorrect (or misleading) to call them something like "incongruent" sets?
Copyright © 2021 JogjaFile Inc.
Simply "$\subseteq$-incomparable" should suffice.
Incongruent would bring connotations of some sort of congruency relation, but this is not the case, since $\subseteq$ is not a congruence relation. It's just a partial order.