Model-Theoretic Connections

Three Finite Basis Theorems

Tarski asked whether a finite algebra always has a finite equational basis. The answer is no, but three substantial theorems identify hypotheses under which it is yes.

Engineering · Mathematics4 min readKV-MATH-0255

Learning objectives

State the finite basis problem precisely.
State Baker's finite basis theorem and its hypotheses.
Outline the proof strategy via bounded subdirectly irreducibles.
Identify the other finite basis results the source presents.
Recognise inherently non-finitely-based algebras.
Understand what the source records as open on this question.

01The problem

A variety is finitely based when some finite set of identities axiomatises it. Tarski asked whether the variety generated by a finite algebra of finite type is always finitely based.

Key resultThe finite basis problem

Given a finite algebra A of finite type, is V(A) finitely based? And is there an algorithm to decide, given A, whether V(A) is finitely based? The source records the second question as Problem 10, attributed to Tarski, and open as of 1981.

The first question was already known to have a negative answer in 1981: Lyndon constructed a finite algebra generating a non-finitely-based variety. So the programme became identifying hypotheses under which finite basis holds.

02Baker's theorem

Key resultBaker's finite basis theorem

If A is a finite algebra of finite type and V(A) is congruence-distributive, then V(A) is finitely based.

ProcedureThe proof strategy

in: finite A generating a CD variety → out: a finite equational basis

input: finite A of finite type, V(A) congruence-distributive
step 1: Jónsson's lemma gives SI members of V(A) inside HS({A})
since A is finite and the set is finite, ultraproducts collapse
step 2: so the subdirectly irreducibles are finite and bounded by |A|
step 3: congruence distributivity gives definable principal congruences,
via bounded chain length from the Jónsson terms
step 4: subdirect irreducibility becomes a first-order condition
step 5: write identities excluding every algebra that is not in V(A)
the bound on SIs means finitely many identities suffice
output: a finite equational basis for V(A)

Steps 1 and 3 are where congruence distributivity is used, twice and essentially. Caveat: the basis produced is enormous — the theorem is an existence result, not a practical axiomatisation method.

Baker's theorem covers a great deal: every finite lattice, every finite Boolean algebra with operators, every finite Heyting algebra and every finite quasiprimal algebra generates a finitely based variety.

03The other results

The source presents three finite basis theorems in Chapter V §4, of which Baker's is the most celebrated.

The three theorems and their hypotheses
Hypothesis	Conclusion	Mechanism
Congruence-distributive, finitely generated	finitely based	Jónsson's lemma plus definable principal congruences
Bounded subdirectly irreducibles plus definability	finitely based	the general mechanism Baker's theorem instantiates
Certain congruence conditions on the variety	finitely based	term-condition arguments

All three share the same architecture: bound the subdirectly irreducibles, make subdirect irreducibility first-order, and convert the resulting sentence into finitely many identities. The hypotheses differ in how they secure the bound.

04Inherently non-finitely-based algebras

Some finite algebras fail to be finitely based in a strong sense: no finitely based variety contains them and consists only of locally finite algebras.

Non-finitely based

V(A) has no finite basis

The variety generated by A requires infinitely many identities. Lyndon's example is the classical instance.

Inherently non-finitely based

Stronger

A lies in no finitely based locally finite variety at all. Not merely V(A) but everything reasonable containing A fails.

CautionFiniteness of the algebra gives no guarantee

The intuition that a finite object should have a finite description is misleading here. A finite algebra can generate a variety requiring infinitely many identities, and identifying which finite algebras do was a major programme. Congruence distributivity is what rules it out in Baker's setting.

05What the source records as open

The closing survey lists the decidability of the finite basis property as Problem 10, attributed to Tarski.

Pre-1981
Lyndon's counterexample
A finite algebra generating a non-finitely-based variety. Settles the existence question negatively.
1970s
Baker's theorem
Congruence distributivity plus finite generation gives a finite basis. The main positive result of the period.
1981
The source's Problem 10
Is there an algorithm deciding whether V(A) has a finitely based equational theory, for A a finite algebra of finite type? Recorded as open.
Post-source
Resolved
The decidability question was settled after the source was written. The Research Frontier stream reports the outcome and marks it as beyond the 1981 text.

NoteWhy this is flagged rather than stated here

The source presents Problem 10 as open, and it is not. Stating the resolution here without marking it would misrepresent what the text says; omitting it entirely would leave a reader believing a settled question is open. The collection's convention is to report the source faithfully and route the update to a page explicitly marked as post-source.

06Practical bearing

Existence, not construction

Bases are astronomically large

Baker's theorem guarantees a finite basis without producing a usable one. Explicit bases for specific finite algebras are found by other means, usually computational.

Elementary class

The payoff

A finitely based variety is an elementary class, so compactness and the whole model-theoretic apparatus apply to it. This is often the real reason a finite basis matters.

Computational tools

Where to look

Finding explicit equational bases for small finite algebras is a job for UACalc and automated theorem provers rather than for hand computation. The sourcing policy page routes to current tools.

Frequently asked

Does every finite lattice generate a finitely based variety?

Yes, by Baker's theorem — lattices are congruence-distributive, and a finite lattice is a finite algebra of finite type. The same applies to any finite algebra whose generated variety is congruence-distributive.

Is congruence distributivity necessary for a finite basis?

No, it is sufficient only. Many finite algebras outside congruence-distributive varieties generate finitely based varieties — finite groups, for instance, by Oates and Powell. The hypothesis in Baker's theorem is not a characterisation.

How large is the basis Baker's theorem produces?

The construction gives no useful bound and the resulting basis is enormous even for small algebras. The theorem should be read as an existence statement. Where an explicit basis is wanted, it is found by search rather than by following the proof.

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.