Research Frontier and Sourcing

Recent Developments: the 1981 Frontier

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 · Mathematics4 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.