Free monoid completeness of the Lambek calculus allowing empty premises
We prove that the Lambek syntactic calculus allowing empty premises is complete with respect to the class of all free monoid models (i. e., the class of all string models, allowing the empty string).