KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesDecidability Questions in Universal AlgebraEngineering · Engineering MathematicsLesson 33/883← PrevNext →
GuidePublished 12 Aug 2026Updated 13 Aug 20267 min readBy Kevin Jogin
On this page

Ask about this page

KEVOS AIDecidability Questions in Universal Algebra

KEVOS knowledge first · trusted web sources when needed

Recent Developments and Resources

Decidability Questions in Universal Algebra

Which questions about varieties and algebras admit algorithms, and the dividing lines that later work established.

Category Engineering / MathematicsSource RD.3Pages 285-287Reading 2 minReviewed 2026-08-07

Learning objectives

  • Distinguish the main decision problems
  • Report the status of each
  • Identify the structural features driving decidability
Beyond the source

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.

On this page
  1. The problems
  2. Status
  3. What drives decidability
  4. Attribution

The problems

Decision problems about varieties
ProblemInputQuestion
Word problemA finite presentation, two termsAre the terms equal?
Equational theoryA finite algebra, an identityDoes the identity hold in the generated variety?
First-order theoryA variety, a sentenceIs the sentence true in every member?
Finite basis problemA finite algebraDoes the generated variety have a finite basis?
Residual smallnessA finite algebraIs the generated variety residually small?

Status

Known results
ProblemStatusAttribution
Word problem for semigroupsUndecidableMarkov, Post (1947)
Word problem for groupsUndecidableNovikov, Boone (1950s)
Equational theory of a finite algebraDecidableCheck all assignments — finite
First-order theory of a finitely generated varietyDecidable or not, depending on the varietyVarious
Tarski's finite basis problemUndecidableMcKenzie (1996)
Residual smallness for finite algebrasUndecidableMcKenzie (1996)
Decidability of a locally finite variety's first-order theoryCharacterisedMcKenzie and Valeriote (1989)
A striking asymmetry

The equational theory of a single finite algebra is trivially decidable — evaluate the identity on all assignments. But whether that variety has a finite basis is undecidable. Deciding individual identities and deciding properties of the whole theory are problems of entirely different character.

What drives decidability

The decidable cases share a structural feature: every member is transparently built from a bounded family of pieces, so no computation can be simulated.

Strong representation theoremEvery member is a product or Boolean product of a bounded list
No simulation possibleThe algebra cannot encode a Turing machine
Reduce to a decidable baseUsually Boolean algebras or modules
DecidableBy quantifier elimination or reduction
The dividing line
Decidable sideUndecidable side
Discriminator varieties, finitely generatedSemigroups
Boolean algebrasGroups
Abelian groupsRings
K-vector spacesLattices
Varieties omitting the right typesVarieties admitting all types
McKenzie–Valeriote

The characterisation of decidable locally finite varieties says, roughly, that such a variety decomposes into a discriminator part, an affine part and a unary part, with strong restrictions on how they interact. Anything richer allows the simulation of computation.

Attribution

What belongs where

The source's Recent Developments chapter identifies decidability as an active area and reports the state as of around 1981. The McKenzie undecidability results (1996) and the McKenzie–Valeriote characterisation (1989) are later and are reported here as subsequent developments. The word problem results of Markov, Post, Novikov and Boone predate the source and are classical.

Frequently asked questions

Is the word problem always undecidable for infinite varieties?

No. The word problem for abelian groups and for Boolean algebras is decidable. Undecidability requires enough non-commutativity or combinatorial freedom to encode computation.

Does undecidability of the finite basis problem contradict Baker's theorem?

No. Baker gives a sufficient condition that is itself decidable to check — one can test whether a finite algebra generates a congruence-distributive variety. What is undecidable is the general question with no such hypothesis.

Related pages

  • The Classification of Varieties and Tame Congruence Theory
  • Boolean Constructions: Recent Work
  • Discriminator Varieties and their Structure

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.3, book pages 285-287.

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.

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 Decidability Questions in Universal Algebra. 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 Decidability Questions in Universal Algebra as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—questions, decidability, universal, algebra, varieties—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

  1. Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
  2. Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
  3. Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
  4. Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
  5. 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.

StageRecordQuality check
InputObjects, domain, notation, assumptionsEvery symbol is defined
MethodPermitted operation or cited result at each stepAll hypotheses hold
OutputExact result and representationCorrect type, domain and form
VerificationSubstitution, invariant or alternative derivationIndependent agreement
Boundary testZero, identity, degenerate or failed hypothesisScope 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 Decidability Questions in Universal Algebra?

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 questions 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.

  • NIST Digital Library of Mathematical Functions — National Institute of Standards and Technology. Used for mathematical notation, numerical methods, asymptotics and special functions. Accessed 2026-08-13.
  • MIT OpenCourseWare — Number Theory I — Massachusetts Institute of Technology. Used for algebraic and analytic number theory. Accessed 2026-08-13.

Continue learning

Domain Deep-Dive — Development Approach & Life CycleGuide · Engineering MathematicsPMBOK 7 — The 8 Performance DomainsGuide · Engineering MathematicsThe 8 Performance DomainsGuide · Engineering MathematicsThe Prerequisite Dependency GraphGuide · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®