Mathematical logic and foundations Definition
Universal class
Definition
Let be a first-order signature. A universal sentence of is a sentence of the form , with universal quantifiers. Here is a quantifier-free formula whose free variables are among . Let be a class of -structures. Then is a universal class if there is a set of universal sentences of whose models are exactly the members of .
Remarks
Example: simple graphs, in the signature with one binary relation , form a universal class with the axioms and .
Non-example: fields, in the signature , do not form a universal class. A universal sentence true in a structure is true in each substructure, because it only speaks about tuples of elements and the operations on them. The ring is a substructure of the field in this signature, and it is not a field.
Every universal class is an elementary class. The Łoś–Tarski preservation theorem gives the converse characterization: an elementary class is universal exactly when it is closed under substructures.
Reading path
To understand this page from the ground up, read these 5 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Sentence concept
- Signature concept
- Structure concept
- Universal quantifier concept
- Universal class definition
Further reading
About this page
| Tag | NX9X1A5EKY |
|---|---|
| URI | m2://NX9X1A5EKY |
| Kind | definition |
| Writing | W0 stub |
| MSC | 03C52, 03C40 |
| Defines | Universal class |
| Uses | Signature, Structure, Sentence, Universal quantifier |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.