In the setting of partial concept classes, our main contribution is a proof that an alternative version of the SSP lemma, which bounds the growth function, holds in this setting. In contrast, [1]} showed that the traditional version of the lemma (the "combinatorial" one) does not hold for partial concept classes. We remark that these two versions are equivalent for total concept classes. This lemma allows us to "tensorize" the disambiguation lower bound that was proved in [1]} for binary classes and establish it for the multiclass setting.
