Research Frontier and Sourcing
The Finite Basis Problem after Tarski
Tarski asked whether the finite basis property is decidable. McKenzie proved in 1996 that it is not, which closed the general question and left hypothesis-specific theorems as the only route.
This page covers developments that postdate the 1981 source. It is included because it is the direct continuation of themes the source raises, and is marked so its provenance stays legible.
- State Tarski's problem as the source poses it.
- State McKenzie's negative resolution.
- Explain what undecidability of the property means in practice.
- List the positive finite basis theorems obtained since the source.
- Explain why hypothesis-specific theorems remain valuable.
- Distinguish this page's content from the source's.
01The problem as posed
The source records it as Problem 10, attributed to Tarski, in the decidability section of the closing survey.
Is there an algorithm to determine if V(A) has a finitely based equational theory, given that A is a finite algebra of finite type? The source describes it as a difficult question and records it as open.
By 1981 it was already known that the answer to the underlying existence question is no — Lyndon had produced a finite algebra generating a non-finitely-based variety. So the remaining question was whether the property could at least be recognised algorithmically.
02The resolution
Tarski's finite basis problem is undecidable. There is no algorithm which, given a finite algebra of finite type, decides whether the variety it generates is finitely based.
- The constructionMcKenzie's proof encodes Turing machine behaviour into finite algebras so that the finite basis property of the generated variety tracks a halting-type condition.
- Consequence: no uniform criterionSince no algorithm exists, there is no finitely checkable characterisation of the finite basis property for finite algebras.
- Consequence: hypotheses are unavoidableEvery finite basis theorem must assume something — congruence distributivity, meet-semidistributivity, a bound on subdirectly irreducibles — because no hypothesis-free criterion can exist.
- What survivesBaker's theorem and its successors are unaffected. They give sufficient conditions, and sufficient conditions are exactly what remains available.
03What undecidability means here
It does not mean any particular finite algebra has an unknowable finite basis status. Many specific algebras are settled, in both directions. What is ruled out is a single procedure covering all of them — the same distinction as between the halting problem and the halting behaviour of a given program.
04Positive results since the source
| Theorem | Hypothesis | Period |
|---|---|---|
| Baker's theorem | finite algebra, congruence-distributive variety | pre-source, in the source |
| Oates–Powell | finite group | pre-source |
| Kruse and Lvov | finite ring | pre-source |
| Willard's theorem | finite algebra, congruence meet-semidistributive variety | post-source |
| Further results using type sets | type-omitting hypotheses | post-source |
Willard's theorem is the most substantial post-source addition, extending Baker's result from congruence-distributive to congruence meet-semidistributive varieties. Both hypotheses have clean type-set characterisations — omitting types 1, 2 and 5, and omitting types 1 and 2 respectively — which is how tame congruence theory feeds back into the finite basis programme.
05How the question is approached now
06Provenance
McKenzie's resolution appeared fifteen years after the 1981 text and is not in it. The source states Problem 10 as open and this page does not alter that statement — the three-finite-basis-theorems page in the Model-Theoretic stream reports the source faithfully and points here.
This separation is the collection's standard practice for anything that has moved since 1981. It keeps the source's own statements intact while ensuring a reader is not left believing a settled question is open.
Frequently asked
Does the negative answer diminish Baker's theorem?
No — it raises its value. Since no general criterion can exist, sufficient conditions are the only available route, and Baker's theorem is the most widely applicable of them. The undecidability result explains why hypothesis-free theorems were never found rather than casting doubt on those that were.
Is the finite basis property decidable under extra hypotheses?
Under some, yes. Restricting to congruence-distributive or meet-semidistributive settings gives positive results, and within particular families the question is often settled. The undecidability applies to the unrestricted problem over all finite algebras of finite type.
How should I check whether a specific finite algebra is finitely based?
There is no general procedure, so the practical route is computational search for a basis combined with checking whether any known sufficient condition applies. UACalc supports the congruence-condition checks; automated equational provers help with candidate bases. The sourcing policy page routes to both.
- 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.