Connections with Model Theory
Preservation Theorems for Universal Sentences
The theorems matching syntactic form to closure under algebraic constructions, with universal sentences and substructures as the model case.
Learning objectives
- State the substructure preservation theorem
- Relate Th_∀ to the class of substructures
- Situate the result among the other preservation theorems
Universal sentences and substructures
A sentence of the form ∀x1…∀xn Φ with Φ quantifier-free.
If A ⊧ Φ for a universal sentence Φ and B is a substructure of A, then B ⊧ Φ.
The reason is immediate: a universal claim about all tuples in A in particular holds for all tuples in the smaller B, and quantifier-free formulas are evaluated identically in a substructure.
A sentence is preserved under substructures if and only if it is logically equivalent to a universal sentence.
The theorem says the syntactic form is not merely sufficient but necessary. Any sentence with the semantic property has a universal form, so nothing is lost by restricting attention to the syntactic class.
Th_∀ and universal classes
The set of universal sentences true in every member of K.
Mod(Th∀(K)) = ISPU(K) — the class of structures embeddable in an ultraproduct of members of K.
So the universal consequences of a class determine, and are determined by, the substructures of its ultraproducts. This is the model-theoretic analogue of Birkhoff's theorem, with universal sentences in place of identities and ISPU in place of HSP.
The full table of preservation theorems
| Sentences | Preserved under | Theorem |
|---|---|---|
| Universal | Substructures | Łoś–Tarski |
| Existential | Extensions | Dual of Łoś–Tarski |
| Positive (no negation) | Homomorphic images | Lyndon |
| Horn | Reduced products, direct products | Horn preservation |
| Identities | H, S, P | Birkhoff |
| Quasi-identities | S, P, PU | Mal'cev |
| ∀∃ sentences | Unions of chains | Chang–Łoś–Suszko |
| All first-order | Ultraproducts | Łoś |
Each row is an instance of one idea: a class of structures closed under certain constructions is exactly the class axiomatisable by sentences of a corresponding syntactic shape. Birkhoff's theorem is the equational instance; the rest of the table is what the same idea produces at other levels of expressiveness.
Why this matters for algebra
- Quasivarieties are located. Mal'cev's theorem identifies them as the classes closed under ISPPU, explaining why cancellative semigroups and torsion-free abelian groups are quasivarieties and not varieties.
- Universal classes cover the substructure-closed cases. Classes like “groups with no element of order 2” are universal and well-behaved even though not equational.
- Failure of preservation certifies non-axiomatisability. If a class is closed under substructures but not expressible universally, Łoś–Tarski says the assumption was wrong somewhere.
- Horn sentences explain direct products. The Horn preservation theorem is why products behave well for so many algebraic classes.
Frequently asked questions
Is the empty structure an issue for universal sentences?
It would be, which is one reason universes are required non-empty. A universal sentence is vacuously true in an empty structure, which would break the correspondence.
Does Łoś–Tarski require the language to be finite?
No. The theorem holds for arbitrary languages, though the equivalent universal sentence may need to be an infinite conjunction if the original theory is infinite.
Source. S. Burris and H. P. Sankappanavar, A Course in Universal Algebra, The Millennium Edition — a corrected re-typesetting of Springer-Verlag Graduate Texts in Mathematics 78 (1981). Section V.2, book pages 245-249.
This page is an original exposition prepared for the KEVOS® knowledge library. It restates and reorganises mathematical results; it is not a reproduction of the source text.