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 in the strongest way.

Principle

The organizing idea is that first-order expressiveness cannot control arbitrary infinite cardinalities: if a theory has an infinite model then, under the logic's Löwenheim–Skolem behaviour, models of different prescribed cardinalities exist, so cardinality is not rigidly characterisable by the syntax alone.

Demonstration

Example: In classical first-order logic the downward Löwenheim–Skolem theorem implies that any satisfiable theory in a countable language has a countable model; this leads to the Skolem paradox: set theory has countable models even though it proves the existence of uncountable sets.

Misapplication

Erroneously concluding from Löwenheim–Skolem that all models of a theory are countable, or that the theorem applies without checking language cardinality or the logic's assumptions; another misuse is to interpret the existence of small models as a semantic refutation of uncountability in the intended interpretation.

Consequence

The property limits the expressive power of the logic with respect to cardinality distinctions, underlies model-theoretic phenomena such as non-categoricity in infinite cardinalities, and motivates the study of stronger logics when cardinality control is required.

Reversal

The reverse situation is found in logics that do not satisfy Löwenheim–Skolem: these can sometimes express or enforce cardinality constraints syntactically (for example certain second-order or infinitary logics), so model sizes can be restricted by formulas.

Boundary

Applies to logics and theories under the usual syntactic assumptions (signature size, compactness conditions); it does not automatically hold in higher-order logics, many finite-model logics, or non-classical frameworks lacking the requisite proof-theoretic or semantic properties.

Semantic Tension

There is tension between Löwenheim–Skolem behaviour and aims of categoricity or absolute cardinal characterisation: enforcing categorical axioms in all infinite cardinalities conflicts with the existence of downward or upward transfers of model sizes.

Synthesis

The Löwenheim–Skolem property formalises the limits of first-order expressiveness about cardinalities: it guarantees transfer of satisfiability across certain sizes and thereby explains why many set-theoretic or cardinality-sensitive notions cannot be pinned down purely by first-order syntax.