Adding relation symbols and quantifiers to the algebraic language buys enormous expressive power and costs the whole equational apparatus. Chapter V is the accounting of that trade.
Engineering · Mathematics10 min readKV-MATH-0247
Learning objectives
Specify a first-order language and distinguish it from an algebraic type.
Define a structure and identify algebras as the relation-free case.
Build terms and formulas and track free versus bound variables.
Classify formulas as atomic, quantifier-free, universal, existential and Horn.
Explain what expressive power is gained and what closure properties are lost.
Recognise where equational methods stop applying.
01Languages
A first-order language L consists of operation symbols with arities, relation symbols with arities, and the logical apparatus: variables, equality, connectives and quantifiers.
L = ⟨F, R⟩ with arities; logical symbols &, ∨, ¬, →, ↔, ∀, ∃, ≈
An algebraic type is the special case R = ∅. Adding relation symbols is the first extension; adding quantifiers is the second and larger one.
What each ingredient buys
Ingredient
Expressive gain
Cost
Operation symbols
the algebraic content
none — this is the base case
Relation symbols
orderings, incidences, graphs
substructures behave differently
Connectives
implications between equations
H-closure lost; gives quasivarieties
Quantifiers
existence and universality claims
Birkhoff's theorem no longer applies
The source's convention is to keep the model-theoretic notation aligned with Chang and Keisler, which is why F is used for both the type of an algebra and the operation symbols of a language, disambiguated by context.
02Structures
A structure for L is a non-empty set together with an interpretation of every symbol: an operation for each operation symbol, a relation for each relation symbol.
A = ⟨A, L⟩ fA : An → A, rA ⊆ Am
An algebra is a structure with no relation symbols. Every notion from Chapter II generalises, but the generalisations are not always the useful ones.
CautionSubstructure is not subalgebra when relations are present
A substructure must be closed under the operations, and the relations are inherited by restriction. But a subset closed under the operations always gives a substructure, whereas whether the restricted relation is the 'right' one depends on the intended reading. Ordered structures are the standard trap: a substructure of a linear order is a linear order, but a substructure of a well-order need not be well-ordered, and well-ordering is not first-order expressible.
03Terms and formulas
Terms are built exactly as in the algebraic case, from variables and operation symbols. Formulas are built from atomic formulas by connectives and quantifiers.
ProcedureThe formula-building recursion
in: language L → out: the set of L-formulas
atomic formulas:
p ≈ q for terms p, q
r(p₁,…,pₘ) for an m-ary relation symbol r and terms pᵢ
if φ and ψ are formulas, so are:
¬φ, (φ & ψ), (φ ∨ ψ), (φ → ψ), (φ ↔ ψ)
if φ is a formula and x a variable, so are:
∀x φ and ∃x φ
free variables: those not in the scope of a quantifier binding them
a sentence is a formula with no free variables
Every formula is finite, so it mentions finitely many variables and finitely many symbols. That finiteness is what makes compactness possible. Caveat: infinitary logics drop it and lose compactness with it.
The free/bound distinction is where most early errors occur. A formula with free variables is not true or false in a structure — it is satisfied or not by particular assignments to those variables. Only sentences have truth values.
04The formula hierarchy
Restricting the shape of formulas gives classes with distinctive preservation properties, and the preservation theorems later in this stream are organised by them.
Formula classes
Class
Shape
Preserved by
Atomic
p ≈ q or r(p⃗)
homomorphisms, substructures, products
Quantifier-free
Boolean combinations of atomic
substructures, embeddings
Universal (∀)
∀x⃗ ψ with ψ quantifier-free
substructures
Existential (∃)
∃x⃗ ψ with ψ quantifier-free
extensions
Positive
no ¬ or →
surjective homomorphisms
Horn
conjunctions of clauses with ≤ 1 positive literal
direct products
Identity
∀x⃗ (p ≈ q)
H, S and P — the equational case
Identities are the intersection of several rows: universal, positive and Horn at once. That triple membership is exactly why they are preserved by all three class operators, and hence why Birkhoff's theorem holds for them and nothing weaker.
05What is gained
Expressivity
Conditions no equation can state
Being a field, being torsion-free, being simple, having no zero divisors — none is equational, all are first-order or nearly so.
Ultraproducts
A new construction
The ultraproduct and Łoś's theorem have no equational counterpart and give access to compactness and to Jónsson's lemma.
Decidability questions
A meaningful notion
Asking whether the first-order theory of a variety is decidable is only possible once first-order sentences are available.
Preservation theorems
Syntax from semantics
Characterising which sentences are preserved by which constructions is a genuinely first-order programme, and each result is a small Birkhoff theorem.
06What is lost
Equational setting
Complete, HSP applies
Birkhoff's theorem, free algebras, equational logic with a completeness theorem, and a decidable notion of derivability for well-behaved varieties.
First-order setting
No HSP analogue
Classes defined by arbitrary first-order sentences are not closed under H, S or P in any useful pattern. There is no free structure. Derivability remains complete but the algebraic characterisation is gone.
Key resultThe trade in one line
Equations are weak enough to have a structure theory; first-order sentences are strong enough to say what one wants and too strong for the structure theory to survive. Chapter V works in the gap, using first-order tools to prove equational results — principal congruence formulas and the finite basis theorems are exactly that.
Frequently asked
Is equality a relation symbol or a logical symbol?
A logical symbol, interpreted as genuine identity in every structure. Treating it as a relation symbol would allow structures where ≈ is some other congruence, which gives first-order logic without equality — a weaker system. The source, following Chang and Keisler, treats equality as logical.
Why must structures be non-empty?
Convention, chiefly to keep ∀x φ → ∃x φ valid. Empty structures can be accommodated in free logic at the cost of complicating the axioms. The algebraic convention of non-empty universes, adopted in Chapter II, matches the model-theoretic one here.
Can I still use free algebras in the first-order setting?
Only for the equational part. Free structures for a first-order theory generally do not exist, because the universal mapping property depends on the theory being closed under the constructions that build the free object. Where a first-order theory happens to be equational, the free algebra survives and is the same object.
Sources and further reading
S. Burris and H. P. Sankappanavar, A Course in Universal Algebra, Millennium Edition (a corrected re-typesetting of Springer GTM 78, 1981).
G. Grätzer, Universal Algebra, 2nd edition, Springer.
R. McKenzie, G. McNulty and W. Taylor, Algebras, Lattices, Varieties, Volume I.
Original KEVOS® explanatory article. Written from the topic map of the cited works; no text is reproduced from them.
Handbook application: from concept to controlled practice
Purpose. This expanded section turns the original page into a practical handbook. It preserves the supplied material and adds a repeatable way to apply, check and review First-order Languages and Structures. It does not replace a contract, legislation, a controlled standard, competent engineering judgement or specialist advice.
The operating aim is to turn a compact mathematical statement into a usable chain of definitions, claims, examples and checks. Read the original explanation first, then use the workflow and checks below to convert knowledge into evidence.
Treat First-order Languages and Structures as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—structures, first-order, languages, terms, formulas—should be made explicit before any proof or computation begins. Record the ambient set or structure, the permitted operations and the equality or equivalence relation in use. A compact theorem often changes meaning when the base field, finiteness condition, commutativity assumption or direction of an action changes.
For a proof, write the hypotheses as a checklist and mark the line at which each one is used. For a computation, state the representation of the input, the arithmetic model, the termination condition and the output invariant. For a classification problem, distinguish existence from uniqueness and distinguish an object from its representation. These separations prevent a correct local calculation from being mistaken for the general result.
A useful worked example should be small enough to inspect completely but rich enough to exercise the main mechanism. Compute the result in two ways where practical: symbolically and by substitution, structurally and numerically, or directly and through a normal form. Then include one near-miss example in which a hypothesis fails. The contrast explains why the theorem is shaped as it is and gives the reader a diagnostic pattern for later problems.
Verification is part of the mathematics. Check domains and codomains, substitute proposed solutions, test identity and zero cases, compare dimensions or cardinalities, and confirm that maps respect the required operations. In numerical work, report precision, conditioning and a residual rather than digits alone. In algorithmic work, separate mathematical correctness from implementation complexity and resource limits.
Step-by-step operating method
Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
Verify independently. Substitute back, check invariants, test boundary cases or use an alternative derivation.
Worked-example protocol
Illustrative method—not a source theorem. Start with a small admissible input and list the definitions it must satisfy. Carry out each transformation on a separate line, citing the property that permits it. Preserve exact values until approximation is necessary. At the end, verify the output against the original definition and one invariant such as dimension, degree, determinant, order, norm or residual. Then alter one hypothesis and observe which step ceases to be valid. This protocol creates a reusable example without inventing a theorem-specific numerical answer.
Stage
Record
Quality check
Input
Objects, domain, notation, assumptions
Every symbol is defined
Method
Permitted operation or cited result at each step
All hypotheses hold
Output
Exact result and representation
Correct type, domain and form
Verification
Substitution, invariant or alternative derivation
Independent agreement
Boundary test
Zero, identity, degenerate or failed hypothesis
Scope is understood
Common failure modes and recovery actions
1. Watch for
Using a theorem without checking every hypothesis.
Recovery: Return to the governing definition or requirement and restate the decision in one sentence.
2. Watch for
Treating a suggestive example as a proof of the general case.
Recovery: Separate evidence from assumption, assign an owner and set a date for validation.
3. Watch for
Changing notation or conventions part-way through an argument.
Recovery: Run a small counterexample, boundary test, pilot or independent check before proceeding.
4. Watch for
Hiding a division-by-zero, convergence, finiteness or commutativity assumption.
Recovery: Record the consequence, decision and rationale, then update the controlled baseline.
5. Watch for
Reporting a computed result without a residual, substitution or structural check.
Recovery: Escalate when the issue affects safety, compliance, acceptance, material value or an agreed tolerance.
Review checklist
Can every symbol be traced to a definition or prior result?
Which hypothesis does each major step use?
Does the method cover zero, identity, degenerate and boundary cases?
Can the conclusion be checked by a second representation or calculation?
Are mandatory requirements distinguished from recommendations and illustrative values?
Are sources, assumptions, units, dates and versions recorded closely enough to reproduce the decision?
Have safety, legal, ethical, stakeholder and operational consequences been considered at the appropriate level?
Is there a named owner and a trigger for review, escalation, change or retirement?
Questions for deeper application
What is the most important distinction a practitioner must preserve when applying First-order Languages and Structures?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
Which assumption about structures would change the result most if it proved false?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
What evidence would allow an independent reviewer to reproduce or challenge the conclusion?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
Which boundary, exception or failure case has not yet been tested?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
What must be handed over, monitored or reviewed after the immediate work is complete?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
Authoritative references and use notes
The sources below were selected as institutional or primary guidance for the broader practice. They support the handbook method; they do not imply that every statement or clause in a source applies to every project. Confirm the current edition, jurisdiction, contract and application before treating any requirement as mandatory.
MIT OpenCourseWare — Algebra I — Massachusetts Institute of Technology. Used for groups, vector spaces, linear transformations and linear groups. Accessed 2026-08-13.
The Stacks Project — table of contents — The Stacks Project. Used for commutative algebra, homological algebra, modules and derived categories. Accessed 2026-08-13.
