Minimal verifying tests of functions from the Post classes

We study the behavior of the function $L(f)$ that is equal to the minimally sufficient number of sets forming a checking test for a Boolean function $f$ with respect to single constant errors in the case when the functions $f$ belong to Post classes. We indicate the possible values of $L(f)$ for various functions $f$ of each Post class.