Löwenheim number

An abstract logic, for the purpose of Löwenheim numbers, consists of:

• A collection of "sentences";
• A collection of "models", each of which is assigned a cardinality;
• A relation between sentences and models that says that a certain sentence is "satisfied" by a particular model.

The theorem does not require any particular properties of the sentences or models, or of the satisfaction relation, and they may not be the same as in ordinary first-order logic. It thus applies to a very broad collection of logics, including first-order logic, higher-order logics, and infinitary logics.

The Löwenheim number of a logic L is the smallest cardinal κ such that if an arbitrary sentence of L has any model, the sentence has a model of cardinality no larger than κ.

Löwenheim proved the existence of this cardinal for any logic in which the collection of sentences forms a set, using the following argument. Given such a logic, for each sentence φ, let κ_φ be the smallest cardinality of a model of φ, if φ has any model, and let κ_φ be 0 otherwise. Then the set of cardinals

{ κ_φ : φ is a sentence in L }

exists by the axiom of replacement. The supremum of this set, by construction, is the Löwenheim number of L. This argument is non-constructive: it proves the existence of the Löwenheim number, but does not provide an immediate way to calculate it.

Two extensions of the definition have been considered:[2]

• The Löwenheim–Skolem number of an abstract logic L is the smallest cardinal κ such that if any set of sentences T ⊆ L has a model then it has a model of size no larger than max(|T|, κ).
• The Löwenheim–Skolem–Tarski number of L is the smallest cardinal such that if A is any structure for L there is an elementary substructure of A of size no more than κ. This requires that the logic have a suitable notion of "elementary substructure", for example by using the normal definition of a "structure" from predicate logic.

For any logic for which the numbers exist, the Löwenheim–Skolem–Tarski number will be no less than the Löwenheim–Skolem number, which in turn will be no less than the Löwenheim number.

Note that versions of these definitions replacing "has a model of size no larger than" with "has a model smaller than" are sometimes used, as this yields a more fine-grained classification.[2]

• The Löwenheim–Skolem theorem shows that the Löwenheim–Skolem–Tarski number of first-order logic (with countable signatures) is ℵ₀. This means, in particular, that if a sentence of first-order logic is satisfiable, then the sentence is satisfiable in a countable model.
• It is known that the Löwenheim–Skolem number of second-order logic is larger than the first measurable cardinal, if there is a measurable cardinal.[2] (And the same holds for its Hanf number.) The Löwenheim number of the universal (fragment of) second-order logic however is less than the first supercompact cardinal (assuming it exists).

• Menachem Magidor and Jouko Väänänen. "On Löwenheim-Skolem-Tarski numbers for extensions of first order logic", Report No. 15 (2009/2010) of the Mittag-Leffler Institute.
• Yi Zhang Logic and algebra 2002. ISBN 0-8218-2984-X