Аннотация:We give an alternative proof of the fact that the product-free Lambek calculus is complete with respect to cofinite language models. It was first proved by Buszkowski in 1982 by the method of barriers. We use another method, which is also based on the technique of canonical models, to obtain a new proof of this result.