$L$-completeness of the Lambek calculus with the reversal operation allowing empty antecedents

In this paper we prove that the Lambek calculus allowing empty antecedents and enriched with a unary connective corresponding to language reversal is complete with respect to the class of models on subsets of free monoids ($L$-models).