Bounded Boolean Powers and Transfer Results
The bounded variant of the Boolean power construction and the transfer theorems it supports.
Engineering articles and subject areas in the KEVOS knowledge library. 2176 pages.
The bounded variant of the Boolean power construction and the transfer theorems it supports.
How to structure and prioritise a manufacturing cost-reduction portfolio across labour, rework and scrap, tooling and fixtures, inventory, energy and maintenance.
A detailed KEVOS handbook on Business Analysis & Its 6 Domains, covering core concepts, application, evidence, common errors and review checks.
A manufacturing improvement case study using a low-cost jig, with before/after assembly time, rework, labour cost, annual savings and payback calculations.
The operators taking homomorphic images, subalgebras and products of a class, the inclusions among their composites, and the identity HSP that computes the generated variety.
Working with the duality in practice: how to translate a specific problem into its dual form, and the properties that correspond on each side.
Closure operators, the complete lattices of closed sets they generate, and the correspondence that makes them the organising device behind subuniverses, congruences and generate…
Lattices in which every subset — not merely every pair — has a supremum and an infimum, and the surprisingly economical criterion that establishes completeness from one half of …
Varieties in which every congruence lattice is distributive or modular, the term conditions characterising them, and the structure theory each unlocks.
Congruences: the equivalence relations compatible with the operations. The substitution property, why it is the right condition, and the failure modes when it is absent.
Which questions about varieties and algebras admit algorithms, and the dividing lines that later work established.
A practical DFMA guide to the product decisions that commit manufacturing cost before the first production part is made.
DOE fundamentals for manufacturing: factors, levels, responses, run matrices, interactions, testing, analysis and response optimisation.
Compares early design-stage cost reduction with late production cost-down and shows where each approach can create value.
The direct product construction, the projection homomorphisms, and factor congruences — the congruence-lattice signature that detects when an algebra decomposes as a product.
Algebras that admit no non-trivial direct decomposition, the congruence-lattice condition characterising them, and the limits of unique factorisation.
Varieties generated by classes of algebras sharing a discriminator term, and the representation theory that makes them, in the source's words, remarkably well-behaved.
The distributive law for lattices, its self-dual character, and the concrete examples that make distributivity the most important special condition in lattice theory.
DMADV explained for new products and processes: Define, Measure, Analyze, Design and Verify with CTQs, risk analysis and robust design.
Root-cause analysis in manufacturing using Pareto prioritisation, Fishbone structure, 5 Whys and data verification.
How to sustain manufacturing gains using standard work, SPC, capability monitoring, ownership, audit and reaction plans.
How to define a manufacturing improvement project using a clear problem statement, customer voice, CTQs, SIPOC boundaries and measurable project objectives.
A manufacturing-focused guide to Define, Measure, Analyze, Improve and Control, showing how the phases connect from problem statement to sustained process performance.
How to develop, test and select manufacturing countermeasures using mistake-proofing, controlled trials, standard-work design and benefit verification.
How to quantify manufacturing baseline performance and cost using check sheets, run charts, operational definitions and reliable data.
Predictive to adaptive, delivery cadence, life cycle & phases, selecting & aligning an approach.
Structures indistinguishable by first-order sentences, and substructures that agree with the ambient structure on every formula.
A detailed KEVOS handbook on Elicitation, Analysis & Requirements, covering core concepts, application, evidence, common errors and review checks.
A formal proof system for identities, its five rules, and the completeness theorem matching syntactic derivability with semantic consequence.
Equivalence relations on a set, their equivalent description as partitions, and the complete lattice Eq(A) they form — the ambient lattice inside which every congruence lattice …
Filters as upward-closed meet-closed subsets, ideals as their duals, and their correspondence with congruences.
The reduced product construction in detail: how a filter on the index set determines which coordinates matter.
The syntax of first-order logic as universal algebra needs it: languages with function and relation symbols, terms, formulas, and the distinction between free and bound variables.
Structures as the semantic counterpart of languages: sets carrying interpretations of every function, constant and relation symbol.
How to use an Ishikawa/Fishbone diagram to structure manufacturing root-cause hypotheses across equipment, process, people, materials, environment and management.
A detailed KEVOS handbook on Flashcards & Self-Quiz, covering core concepts, application, evidence, common errors and review checks.
A practical guide to Failure Mode and Effects Analysis for identifying failure modes, effects, causes, controls and risk-reduction actions in manufacturing.
Fully invariant congruences on the term algebra, their correspondence with equational theories, and the lattice anti-isomorphism between theories and varieties.
A practitioner
Homomorphisms as structure-preserving maps, kernels as congruences, and the first isomorphism theorem in the generality where it belongs.
The syntactic class matching closure under reduced products, and why direct products behave so well for the classes algebra cares about.
How to use ideas-per-worker metrics carefully to understand improvement participation without turning suggestion counts into a vanity KPI.
Identities as pairs of terms, what it means for an algebra to satisfy one, and the Galois connection between classes of algebras and sets of identities.
How engineers and front-line employees can improve manufacturing processes through observation, evidence, small trials and standardisation without waiting for a large transforma…
Minimal generating sets that admit no proper generating subset, and the theorem constraining the possible sizes of such bases in an algebra with an algebraic closure operator.
The theorem bounding the subdirectly irreducible algebras of a congruence-distributive variety, and the structural consequences that follow from it.
Maps between lattices that respect the operations, and the sharp distinction between lattice homomorphisms and merely order-preserving maps — a distinction that has no analogue …
A lattice can be defined purely equationally, as a set with two binary operations satisfying four pairs of identities. This is the definition that makes lattices algebras in the…