Recent Developments and Resources
Structure Theory and Finite Basis Developments
Advances in the structure theory of varieties and in the finite basis problem after the source's period.
Learning objectives
- Report the principal finite basis results after Baker
- Describe developments in structure theory
- Attribute each correctly
Material on this page extends past the 1981 text and its Millennium re-typesetting. Statements here are attributed to later literature, not to Burris and Sankappanavar. Where the status of a question is unsettled, this page says so rather than resolving it.
Finite basis results after Baker
| Result | Hypothesis | Attribution |
|---|---|---|
| Baker's theorem | Finitely generated, congruence-distributive, finite type | Baker (1977) |
| McKenzie's theorem | Finitely generated, congruence-modular, residually small | McKenzie (1987) |
| Willard's theorem | Finitely generated, congruence-meet-semidistributive, residually finite | Willard (2000) |
| Tarski's problem is undecidable | No hypothesis — the general question | McKenzie (1996) |
| Park's conjecture | Residually finite finitely generated varieties | Open in general |
Baker settled the congruence-distributive case. McKenzie extended to modular residually small varieties. Willard weakened distributivity to meet-semidistributivity. And McKenzie's undecidability result showed that no hypothesis-free criterion can exist, which explains why the results are all conditional.
McKenzie's undecidability theorem
There is no algorithm that, given a finite algebra of finite type, decides whether the variety it generates has a finite equational basis.
The proof encodes Turing machine computations into finite algebras in such a way that the machine halts if and only if the generated variety fails to be finitely based. It also yields undecidability of residual smallness and of several other properties.
The result closes a problem open since Tarski posed it, and it changes the character of the field: the goal shifts from finding a criterion to finding the widest useful sufficient conditions. Baker's and Willard's theorems are the answers to that revised question.
Structure theory developments
- Tame congruence theory. Hobby and McKenzie's local analysis of finite algebras, giving the five types and the type-omitting characterisations of the Mal'cev conditions.
- Commutator theory. Freese and McKenzie's systematic treatment for congruence-modular varieties, with the abelian/nilpotent/solvable hierarchy.
- The finite lattice representation problem. Still open: whether every finite lattice is the congruence lattice of a finite algebra. Connected to questions in finite group theory.
- Constraint satisfaction. The dichotomy theorem, proved independently by Bulatov and Zhuk in 2017, showing that CSP over a finite template is either tractable or NP-complete according to an algebraic criterion.
- Maltsev conditions and complexity. A systematic correspondence between term conditions and the complexity of associated computational problems.
Open problems in structure theory
| Problem | Status |
|---|---|
| Finite lattice representation problem | Open |
| Park's conjecture on finite bases | Open |
| Classification of finite simple algebras up to term equivalence | Substantially advanced but incomplete |
| Complexity of deciding Mal'cev conditions for a finite algebra | Partially resolved |
| The RS problem for congruence-modular varieties | Resolved by McKenzie |
Baker (1977) is contemporaneous with the source. Everything else on this page — McKenzie's theorems, Willard's theorem, tame congruence theory, commutator theory and the CSP dichotomy — is later work reported here for context and not attributed to Burris and Sankappanavar.
Frequently asked questions
Is Park's conjecture likely to be true?
It remains open. Willard's theorem proves it under an additional hypothesis, which is evidence in its favour, but no proof or counterexample is known in general.
Why is the finite lattice representation problem hard?
Because the Grätzer–Schmidt construction produces infinite algebras, and no general method is known to replace them by finite ones. The problem connects to open questions about finite group actions.
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 RD.5, RD.8, book pages 288-290.
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.