On the number of irreducible coverings of an integer matrix

The metric (quantitative) properties of the set of coverings of an integer matrix are examined. an asymptotic estimate for the logarithm of the typical number of irredundant $\sigma$-coverings is obtained in the case when the number of rows in the matrix is not smaller than the number of its columns. as a consequence, a similar estimate is derived for the number of maximal conjunctions of a boolean function of $n$ variables with the number of zeros no less than $n$.