allExpressions: Create a matrix with all possible combinations of conditions
Description
There are $3^k - 1$ possible expressions (where $k$ is the number of conditions)
for a crisp-set procedure. Possible values for conditions are 1 (presence), 0 (absence) and NA
(the condition being a subset of a larger one).
The matrix grows exponentially so it is not reccomended to run this function for a large number of
causal conditions (say over 12) as the computer will quickly run out of resources.