An adaptation of string-semantic models to the Polymorphic Lambek Calculus is studied. We note that if quantifiers range over arbitrary sets of strings, the polymorphic calculus is incomplete. The semantics is refined so that quantifiers range over sets of strings that are the interpretation of categories, and we prove a completeness result. In addition some other models are considered and there are speculations on the relevance of model theory to linguistics.