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.
Engineering · Mathematics10 min readKV-MATH-0261
NoteBeyond the source text
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.
Learning objectives
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.
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.
NoteProblem 10, as stated in the source
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
Key resultMcKenzie, 1996
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 construction
McKenzie'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 criterion
Since no algorithm exists, there is no finitely checkable characterisation of the finite basis property for finite algebras.
Consequence: hypotheses are unavoidable
Every finite basis theorem must assume something — congruence distributivity, meet-semidistributivity, a bound on subdirectly irreducibles — because no hypothesis-free criterion can exist.
What survives
Baker's theorem and its successors are unaffected. They give sufficient conditions, and sufficient conditions are exactly what remains available.
03What undecidability means here
Undecidable
No algorithm for all finite algebras
There is no procedure taking an arbitrary finite algebra and returning a correct yes/no answer about the finite basis property.
Not: unanswerable case by case
Individual algebras can be settled
For any particular finite algebra the question may well be answerable by a specific argument. Undecidability concerns the uniform problem, not each instance.
CautionUndecidability is a statement about the general problem
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.
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
Sufficient conditions
The main line
Find hypotheses guaranteeing a finite basis. Baker and Willard are the templates, and type-omitting conditions are the current vocabulary.
Inherently non-finitely-based algebras
The other direction
Identify finite algebras lying in no finitely based locally finite variety. A developed theory with its own criteria.
Specific algebras
Case by case
For a particular small algebra, computational search plus ad hoc argument. UACalc and automated provers are the tools.
What is not attempted
A general criterion
Since McKenzie's result, nobody looks for a decision procedure. The negative resolution redirected the field rather than closing it.
06Provenance
CautionThis page postdates the source
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.
What the source says
Problem 10 is open
Correct as at 1981, and reported as such in the Model-Theoretic stream without amendment.
What is now known
Resolved negatively, 1996
Recorded here, on a page flagged as post-source in the page metadata and in the README.
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.
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 The Finite Basis Problem after Tarski. 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 The Finite Basis Problem after Tarski as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—finite, basis, problem, resolution, positive—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 The Finite Basis Problem after Tarski?
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 finite 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 — Linear Algebra — Massachusetts Institute of Technology. Used for systems, vector spaces, determinants, eigenvalues and matrices. Accessed 2026-08-13.
MIT OpenCourseWare — Algebra I — Massachusetts Institute of Technology. Used for groups, vector spaces, linear transformations and linear groups. Accessed 2026-08-13.
