Löwenheim–Skolem Property

A family of results and the associated property for a logic or theory that constrain the cardinalities of models: typically the downward Löwenheim–Skolem theorem says a satisfiable set of sentences has a model of at most a certain smaller cardinality (often countable), while upward versions assert existence of larger models; together they express that satisfiability does not fix model cardinality