$\newcommand{\ci}{\!\perp\!\!\!\perp\!}$On page 11 of the book in the title, Pearl introduces the Dawid notation for conditional independence: $(X\ci Y|Z)_P$ if and only if $P(x|y,z)=P(x|z)$ for all values $x,y,z$ such that $P(y,z)>0.$ A little later on on the same page, Pearl introduces the graphoid axioms: \begin{align*} \text{Symmetry: } (X\ci Y|Z)&\implies(Y\ci X|Z)\\ \text{Decomposition: } (X\ci YW|Z)&\implies(X\ci Y|Z)\\ \text{Weak union: } (X\ci YW|Z)&\implies(X\ci Y|ZW)\\ \text{Contraction: } (X\ci Y|Z)\land(X\ci W|ZY)&\implies(X\ci YW|Z)\\ \text{Intersection: } (X\ci W|ZY)\land(X\ci Y|ZW)&\implies(X\ci YW|Z). \end{align*}
My question is this: what does the notation $YW$ stand for in Decomposition? Or what does $ZW$ stand for in Weak union? The author never explains that notation. Is it set union?
I have looked at this thread, but none of the answers appear to be certain of themselves!
Many thanks for your time!