I have a question that may be trivial but I just can't find an appropriate answer on the Internet. The inclusion-exclusion principle can be used to discern the cardinality of the union among sets $\bar{a} =\lvert \cup_{i=1}^n A_i \rvert$. Similarly, I can use it to count intersections, $\bar{b} =\lvert\cap_{i=1}^n A_i \rvert$, in which case $\bar b$ is the number of elements that belong to all sets. Now, I would like to count the number of elements that are part of any intersection between the sets $A_i$ taken by two, i.e., $ \bar c = \lvert \cup \left\{ A_i \cap A_j \right\} \rvert$. Does this have a particular name? I guess it is a less restrictive intersection operation, as $\bar c \geq \bar b$.
Thanks for your help.