Engineering

Primal Algebras and Functional Completeness

Finite algebras whose term operations are all possible operations, and the remarkable rigidity this forces.

Principal and Generated Congruences

The congruence generated by a set of pairs, the principal congruences generated by a single pair, and the reason principal congruences are the compact building blocks of Con(A).

Process Capability: Cp and Cpk for Manufacturing

How Cp and Cpk compare process spread and centring with specification limits, when capability analysis is meaningful, and how to interpret common capability patterns.

Quotient Algebras and the Natural Map

The construction of the quotient algebra modulo a congruence, the natural surjection onto it, and the universal property that makes quotients the right notion.

Reading Paths: the Short Course and the Research Track

The source text divides into a short introductory course and a research-oriented remainder. This page sets out both routes explicitly, so that a reader can take the material at …

Relations, Functions and Ordinals: a Working Reference

A working reference for the relational and functional apparatus the subject assumes: n-ary relations, inverses, relational product, injections and surjections, and the ordinal n…

Satisfaction and the Tarski Truth Definition

The recursive definition of truth in a structure, and the reason a recursion over formulas requires assignments rather than sentences alone.

Semigroups, Monoids and Quasigroups as Algebras

The one-operation structures and the divisibility structures, presented as algebras. Quasigroups in particular require a careful choice of type, and that choice illustrates a ge…

Semisimple and Directly Representable Varieties

Varieties whose subdirectly irreducible members are all simple, and those whose finite members are all direct products from a fixed finite list.

Set-Theoretic Preliminaries

The set-theoretic apparatus the subject actually uses: classes as well as sets, indexed families, direct products and powers, and the specific conventions that differ from ordin…

Simple Algebras and Congruence Simplicity

Algebras whose only congruences are the two trivial ones. Simplicity is the strongest indecomposability condition and appears throughout the structure theory of varieties.

Manufacturing13 Aug 2026 · 7 min read

SIPOC Diagrams for Manufacturing Process Scoping

How to build and use a SIPOC diagram to define suppliers, inputs, process boundaries, outputs, customers and cost drivers before detailed process analysis.

Sizes of Subdirectly Irreducible Algebras

Bounding how large the subdirectly irreducible members of a variety can be, and the compactness arguments that produce the bounds.

Skew-Free Algebras and Independence

Algebras whose congruences on a product decompose into products of congruences on the factors, and the independence conditions that force this.

Manufacturing13 Aug 2026 · 7 min read

Spring Design for Assembly: A Practical DFA Checklist

A manufacturing-focused Design for Assembly checklist for compression springs covering assembly environment, OD expansion, end type, spring index, solid height and real-line val…

Squags and Sloops

The two varieties of algebras associated with Steiner triple systems — one idempotent, one with a distinguished element — and the relationship between them.

Statistical Process Control (SPC) Charts for Manufacturing

SPC fundamentals for monitoring process stability, distinguishing common and special causes, and using control limits with reaction plans.

Steiner Triple Systems as Algebras

Steiner triple systems recast as algebras, so that combinatorial questions about them become questions about varieties and congruences.

Stone Duality for Boolean Algebras

The full categorical duality between Boolean algebras and Boolean spaces: objects correspond, morphisms correspond with reversed direction, and every construction on one side ha…

Structure Theory and Finite Basis Developments

Advances in the structure theory of varieties and in the finite basis problem after the source's period.

Subalgebras and Algebra Isomorphism

Subalgebras as subsets closed under the operations, the notion of embedding, and isomorphism as the equivalence under which algebras are classified.

Subdirect Products and Subdirect Embeddings

Subalgebras of a direct product that project onto every factor. The construction is weaker than a direct product but available everywhere, and it is the decomposition the subjec…

Subdirectly Irreducible Algebras

The algebras that admit no non-trivial subdirect decomposition. They are characterised by a single lattice-theoretic condition and serve as the atoms of the structure theory.

Sublattices and Lattice Isomorphism

Subsets of a lattice that are lattices in their own right under the inherited operations, the difference between a sublattice and a sub-poset that happens to be a lattice, and t…

Subuniverses and the Generation Operator Sg

The operator Sg that produces the smallest subuniverse containing a given set, its two equivalent descriptions, and the finitary character that makes it an algebraic closure ope…

Term Operations and Polynomial Operations

The functions terms induce on an algebra, the polynomials obtained by allowing parameters, and the clones these families form.

Terms and the Term Algebra T(X)

Terms as formal expressions built from variables and operation symbols, the term algebra they form, and its absolute freeness.

The 12 Principles

A detailed KEVOS handbook on The 12 Principles, covering core concepts, application, evidence, common errors and review checks.

The 8 Performance Domains

A detailed KEVOS handbook on The 8 Performance Domains, covering core concepts, application, evidence, common errors and review checks.

The Boolean Algebra / Boolean Ring Correspondence

The term-equivalence between Boolean algebras and Boolean rings: each structure's operations are term operations of the other, so the two varieties are the same variety in diffe…

The Center of an Algebra

The centre of a general algebra, defined by a term condition generalising the group centre, and its use in characterising modules up to polynomial equivalence.

The Classification of Varieties and Tame Congruence Theory

The programme of classifying locally finite varieties by the local structure of their finite members, developed after the source text.

The Commutator and the Center: Modern Developments

The commutator theory for congruence-modular varieties: the generalisation of the group commutator that the source's centre section anticipates.

The Compactness Theorem via Ultraproducts

The theorem that a finitely satisfiable theory has a model, proved algebraically by an ultraproduct construction, and its consequences.

The Congruence Extension Property

The condition that congruences on a subalgebra extend to the whole algebra, the varieties that satisfy it, and its role in transferring structural results.

The Congruence Lattice Con(A) and its Algebraicity

Con(A) as a complete algebraic lattice, its relationship to the ambient lattice of equivalence relations, and the sense in which it is the fundamental invariant of an algebra.

The Correspondence Theorem for Algebras

The bijection between congruences above a fixed congruence and congruences on the quotient — a lattice isomorphism that makes Con of a quotient an interval in Con of the origi…

The Cost Commitment Curve: Why Design Has the Most Cost Leverage

Explains the manufacturing cost-commitment curve and why early design decisions have greater influence on lifetime manufacturing cost than late production optimisation.

The Definition of an Algebra and its Type

The central definition of the subject: an algebra is a set with a family of finitary operations indexed by a type. Everything that follows is an elaboration of this one idea.

Manufacturing13 Aug 2026 · 7 min read

The Eight Wastes of Lean Manufacturing (DOWNTIME)

A practical manufacturing guide to the eight Lean wastes—Defects, Overproduction, Waiting, Non-utilized talent, Transportation, Inventory, Motion and Extra-processing.

Mechanical13 Aug 2026 · 7 min read

The Engineering Design Process

A repeatable loop from defining the problem to iterating on a tested solution.

The First Two Finite Basis Theorems

Two results giving conditions under which a variety has a finite equational basis, and the general shape of finite basis arguments.

The Five-Step Shop-Floor Improvement Method

A practical improvement workflow combining time study, jig design, standard work, ERP/routing updates and re-measurement.

The Hidden Cost of Micro-Inefficiencies

Quantifies how small daily delays can compound into major annual productivity losses and shows how to build a defensible micro-waste business case.

The M5 and N5 Forbidden-Sublattice Theorems

Two five-element lattices decide modularity and distributivity by exclusion. These theorems convert conditions stated as identities into a finite, checkable structural test.

The PMI Learning Curve (Start Here)

Where to begin and the order to climb — all 27 topics on one learning journey.

The Prerequisite Dependency Graph

The source carries an explicit diagram of prerequisites showing which sections depend on which. This page renders that dependency structure as navigable text and draws out the c…

The Primal Algebra Characterisation Theorem

The theorem identifying primal algebras by intrinsic conditions, and the representation of the generated variety by Boolean powers.