KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesTheories, Models and AxiomatisabilityEngineering · Engineering MathematicsLesson 61/883← PrevNext →
GuidePublished 12 Aug 2026Updated 13 Aug 20268 min readBy Kevin Jogin
On this page

Ask about this page

KEVOS AITheories, Models and Axiomatisability

KEVOS knowledge first · trusted web sources when needed

Connections with Model Theory

Theories, Models and Axiomatisability

Theories as sets of sentences, model classes, and the question of which classes of algebras are first-order axiomatisable.

Category Engineering / MathematicsSource V.1Pages 230-234Reading 3 minReviewed 2026-08-07

Learning objectives

  • Define theory, model class and elementary class
  • State the characterisation of elementary classes
  • Locate varieties within the axiomatisability hierarchy
On this page
  1. Theories and models
  2. Characterising elementary classes
  3. Where varieties sit
  4. Completeness of theories

Theories and models

Th(<strong>A</strong>)
the set of all sentences true in A
Th(<em>K</em>)
the sentences true in every member of K
Mod(&Sigma;)
the class of all models of a set of sentences Σ
Th<sub>&forall;</sub>(<em>K</em>)
the universal sentences true throughout K
Complete theory
one deciding every sentence: Φ or ¬Φ belongs

Th and Mod form a Galois connection exactly parallel to Id and M from Chapter II, but over the full first-order language rather than identities alone.

Definition — Elementary class

A class of the form Mod(Σ) for some set Σ of first-order sentences. A basic elementary class is one where Σ may be taken finite.

Characterising elementary classes

Keisler–Shelah / ultraproduct characterisation

A class K closed under isomorphism is elementary if and only if both K and its complement are closed under ultraproducts — equivalently, K is closed under ultraproducts and elementary equivalence.

The condition on the complement is what distinguishes elementary classes from classes merely closed under ultraproducts.

Axiomatisability of standard classes
ClassElementary?Reason
GroupsYes — basicFinitely many axioms
FieldsYes — basicFinitely many axioms
Algebraically closed fieldsYes, not basicOne axiom per degree; infinitely many needed
Torsion-free abelian groupsYes, not basicOne axiom per n
Torsion abelian groupsNoNot closed under ultraproducts
Finite groupsNoUltraproducts can be infinite
Simple groupsNoNot closed under ultraproducts
Well-ordered setsNoCompactness produces infinite descending chains
The ultraproduct test in practice

To show a class is not elementary, produce members whose ultraproduct escapes the class. Finite groups of unbounded order have infinite ultraproducts; torsion groups of unbounded exponent have ultraproducts with elements of infinite order. Both arguments are two lines once the machinery is in place.

Where varieties sit

The axiomatisability hierarchy
Class typeAxiomsClosure properties
VarietyIdentitiesH, S, P
QuasivarietyQuasi-identitiesI, S, P, PU
Universal classUniversal sentencesI, S, PU
Elementary classArbitrary sentencesI, PU, elementary equivalence

Every variety is an elementary class, since identities are sentences. The converse fails badly: fields form an elementary class and are not a variety.

Basic elementary means finitely axiomatisable

Whether a variety is a basic elementary class is exactly the finite basis question for its equational theory. Chapter V §4 addresses when a finite basis exists, and it is the point where the model-theoretic and equational threads meet.

Completeness of theories

A theory is complete when it decides every sentence, equivalently when all its models are elementarily equivalent.

Completeness of algebraic theories
TheoryComplete?
Th(A) for any single structureYes, by construction
Theory of groupsNo — abelian and non-abelian groups both model it
Theory of algebraically closed fields of characteristic 0Yes
Theory of dense linear orders without endpointsYes
Theory of atomless Boolean algebrasYes
Theory of Boolean algebrasNo — finite and infinite ones differ
Completeness and decidability are different

A complete theory decides every sentence semantically, but there may be no algorithm computing which way. A theory is decidable when it is complete and the set of consequences is computably enumerable in a usable form. The distinction matters in §5.

Frequently asked questions

Is Th(K) always a complete theory?

Only when all members of K are elementarily equivalent. For a variety with diverse members, Th(K) is far from complete.

Why are finite structures problematic for elementary classes?

Because the class of finite structures of a given type is never elementary — compactness always produces an infinite model from structures of unbounded size.

Related pages

  • The Tarski–Vaught Test and Löwenheim–Skolem
  • Filters, Reduced Products and the Construction

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 V.1, book pages 230-234.

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 Theories, Models and Axiomatisability. 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 Theories, Models and Axiomatisability as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—theories, classes, models, axiomatisability, sets—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 Theories, Models and Axiomatisability?

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 theories 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 — Algebra I — Massachusetts Institute of Technology. Used for groups, vector spaces, linear transformations and linear groups. Accessed 2026-08-13.
  • The Stacks Project — table of contents — The Stacks Project. Used for commutative algebra, homological algebra, modules and derived categories. Accessed 2026-08-13.

Continue learning

GeometryGuide · Engineering MathematicsModels, Methods & ArtifactsGuide · Engineering MathematicsNotation and ConventionsGuide · Engineering MathematicsDistributive Lattices and their CharacterisationGuide · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®