The source closes with a survey of where the subject stood in 1981. Read as a historical document it is precise and valuable; read as current it is misleading, and the difference matters.
Engineering · Mathematics10 min readKV-MATH-0257
Learning objectives
Summarise the nine sections of the source's closing survey.
Identify the commutator as the development the authors considered most promising.
Describe the classification-of-varieties diagram and its hierarchy.
Recount the decidability results available by 1981.
Explain what the authors expected of applied universal algebra.
Distinguish reading the survey historically from reading it as current.
01What the chapter is
The Millennium Edition is a corrected re-typesetting of the 1981 Springer text, not a revision. The closing chapter, Recent Developments and Open Problems, is therefore a snapshot of the subject as it stood in 1981, preserved verbatim.
CautionThe edition date and the content date differ
The Millennium Edition carries a 1999 typesetting date and the preface says the subject has flourished mightily since 1981 — while leaving the survey unchanged. A reader encountering the file without that context will reasonably assume the survey is current. It is not, and several of its open problems have since been settled.
The authors are explicit that this is not a comprehensive survey, and direct readers to Taylor's survey article, Jónsson's report and the appendices to Grätzer's book for breadth. Those pointers are themselves of 1981 vintage.
02The nine sections
Structure of the closing survey
§
Topic
Problems posed
1
The Commutator and the Center
1, 2
2
The Classification of Varieties
—
3
Decidability Questions
3–10
4
Boolean Constructions
—
5
Structure Theory
11–13
6
Applications to Computer Science
—
7
Applications to Model Theory
—
8
Finite Basis Theorems
14–15
9
Subdirectly Irreducible Algebras
16–17
Seventeen numbered problems across five of the nine sections. The next page in this stream reviews them as a set.
03The commutator programme
The authors describe the creation of the commutator as one of the most promising developments, and the survey opens with it.
1976
Smith
For any algebra in a congruence-permutable variety, a unique commutator operation on Con A with the expected properties. For groups it recovers the classical commutator of normal subgroups.
1979
Hagemann and Herrmann
Extended the commutator to any algebra in a congruence-modular variety — a substantial widening of scope.
1981 and after
Freese and McKenzie
An alternative definition of the commutator, and the first-order definition of the centre that the source adopts in Chapter II §13.
Consequence
Group notions become general
Solvability, nilpotence and the centre become available across congruence-modular varieties. The source calls this rather abrupt.
Problems 1 and 2 ask for which varieties a commutator can be defined, and for a description of all algebras with Z(A) = ∇ parallel to the characterisation in II§13.
04The classification hierarchy
The source presents a Hasse diagram — Figure 36, the last illustration in the book — showing the useful classes of varieties ordered by inclusion.
all varieties
congruence-modular
congruence-distributive
arithmetical
discriminator→ fully understood
congruence-permutable
(discriminator) ⊗ (modular Abelian)
modular Abelian→ essentially modules
semisimple
trivial varieties
Birkhoff's 1930s suggestion that congruence lattices are the fundamental associated structures is described as remarkably farsighted, and the diagram is the vindication: every useful class in the research literature is defined by a congruence condition.
05Decidability as at 1981
The decidability picture the source reports
Result
Attribution
A variety of groups is decidable iff it is abelian
Szmielew, Ershov, Zamjatin
Any class of groups containing P_S(G) for non-abelian G is undecidable
McKenzie 1982
A variety of rings is decidable iff generated by a zero-ring and finitely many finite fields
Zamjatin 1976
Every finitely generated discriminator variety of finite type is decidable
Burris and Werner 1979
A decidable locally finite congruence-modular variety is (discriminator) ⊗ (modular Abelian)
Burris and McKenzie 1981
No algorithm for equations in ≤ 5 variables in modular lattices
Freese 1979
Equations in ≤ 3 variables in modular lattices are decidable
from Dedekind's free modular lattice on 3 generators
Base undecidability: no algorithm to decide if finite equations axiomatise Boolean algebras
McNulty 1976, Murskiĭ 1971
The authors record a long-standing conviction among researchers in this area that positive decidability and nice structure theory go hand in hand. The Burris–McKenzie classification is the strongest evidence they had, and the subsequent decades largely bore the conviction out.
06Reading the survey correctly
As history
Accurate and valuable
A precise record of what was known and what was being asked in 1981, by two researchers central to the area. The attributions are careful and the problems are well chosen.
As current
Misleading
Several problems are settled. The applications to computer science section predates the entire algebraic CSP programme. The finite basis discussion predates its own resolution.
Key resultThe collection's convention
Pages in the other eight streams report the source faithfully, including presenting its open problems as open. Updates live on pages explicitly flagged as postdating the source — the next page reviews the seventeen problems, and three further pages cover developments the source could not have known. Nothing is silently corrected, and nothing is left stale without a pointer.
Frequently asked
Why was the survey not updated for the Millennium Edition?
The stated purpose of the Millennium Edition was to make the out-of-print Springer text available again with corrections — a re-typesetting, not a revision. Updating the survey would have meant rewriting a substantial chapter and effectively producing a second edition. The preface acknowledges the subject has flourished since 1981 without claiming the text reflects it.
Is the classification diagram still the right picture?
Broadly yes — the congruence-condition hierarchy remains the organising framework, and the classes in Figure 36 are still the ones used. What has been added since is a much finer analysis within the hierarchy, particularly tame congruence theory's local classification of finite algebras, which sits below the level of granularity the 1981 diagram shows.
Which section has dated most?
Section 6, Applications to Computer Science. It is two paragraphs on regular languages and monoid varieties, which was a fair summary in 1981. The algebraic approach to constraint satisfaction, which is by some distance the largest application of universal algebra to computer science, began a decade later and is covered on a separate page in this stream.
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 Recent Developments: the 1981 Frontier. 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 Recent Developments: the 1981 Frontier as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—recent, developments, commutator, classification, programme—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 Recent Developments: the 1981 Frontier?
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 recent 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.
