The Tarski–Vaught Test and Löwenheim–Skolem
The practical criterion for recognising elementary substructures and the theorems that build them at prescribed cardinalities.
Engineering articles and subject areas in the KEVOS knowledge library. 1381 pages.
The practical criterion for recognising elementary substructures and the theorems that build them at prescribed cardinalities.
Hierarchy charts (WBS/OBS/RBS/PBS), the five baselines, and the visual-data-and-information catalog.
The spectrum as the Boolean space indexing an algebra's canonical decomposition, and the spectrum of a variety.
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.
Fully invariant congruences on the term algebra, their correspondence with equational theories, and the lattice anti-isomorphism between theories and varieties.
The full categorical duality between Boolean algebras and Boolean spaces: objects correspond, morphisms correspond with reversed direction, and every construction on one side ha…
The direct product construction, the projection homomorphisms, and factor congruences — the congruence-lattice signature that detects when an algebra decomposes as a product.
Steiner triple systems recast as algebras, so that combinatorial questions about them become questions about varieties and congruences.
The bounded variant of the Boolean power construction and the transfer theorems it supports.
A module generated by one element is a quotient of the Weyl algebra by a left ideal; this page shows how to read off that ideal and when it exists.
The degree of an element of the Weyl algebra is the top total degree in its canonical form. It is additive on products and drops by two on commutators.
Explore this KEVOS knowledge article.
The theorems matching syntactic form to closure under algebraic constructions, with universal sentences and substructures as the model case.
The central theorem of universal algebra: a class of algebras is definable by identities exactly when it is closed under homomorphic images, subalgebras and direct products.
The 1959–60 disproof of Euler's conjecture by Bose, Shrikhande and Parker, and the algebraic construction that produced the counterexamples.
Explore this KEVOS knowledge article.
The workshop analogy and mnemonics for Tuckman, ADKAR, Cynefin, Salience, Situational Leadership and more.
Predictive to adaptive, delivery cadence, life cycle & phases, selecting & aligning an approach.
Structures as the semantic counterpart of languages: sets carrying interpretations of every function, constant and relation symbol.
How polynomial maps between affine spaces correspond to algebra homomorphisms of polynomial rings, and what the Jacobian determinant detects.
The three reports, the contract-type families (fixed-price, cost-reimbursable, T&M, IDIQ), and other artifacts.
Which questions about varieties and algebras admit algorithms, and the dividing lines that later work established.
The reduced product construction in detail: how a filter on the index set determines which coordinates matter.
Multiplicity is additive and positive, so a holonomic module is artinian as well as noetherian, has a composition series, and its length never exceeds its multiplicity.
The syntactic class matching closure under reduced products, and why direct products behave so well for the classes algebra cares about.
Proof that the ring of differential operators of a polynomial ring in characteristic zero is exactly the Weyl algebra, with both lemmas in full.
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…
Subalgebras as subsets closed under the operations, the notion of embedding, and isomorphism as the equivalence under which algebras are classified.
The modular law as a conditional weakening of distributivity, Dedekind's theorem that subgroup lattices of abelian groups are modular, and the reason modularity is the right hyp…
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.
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…
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.
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).
How a linear system of differential equations with polynomial coefficients becomes a cyclic module over the Weyl algebra: quotient by the ideal of its consequences.
What the two showcase applications have in common, the general recipe they illustrate, and an assessment of the source's prediction about the field's direction.
The identity calculus of Boolean algebras: De Morgan's laws, involution, absorption, and the duality principle that halves every proof.
Varieties in which every congruence lattice is distributive or modular, the term conditions characterising them, and the structure theory each unlocks.
The theorem that the subuniverses of any algebra form an algebraic lattice, and the converse showing that every algebraic lattice arises this way.
The Boolean power of an algebra by a Boolean algebra: a construction that transfers results about Boolean algebras to arbitrary varieties.
Universal algebra studies what all algebraic structures have in common by stripping away the particular operations of groups, rings and lattices and asking which theorems surviv…
Two five-element lattices decide modularity and distributivity by exclusion. These theorems convert conditions stated as identities into a finite, checkable structural test.
Explore this KEVOS knowledge article.
Finite algebras whose term operations are all possible operations, and the remarkable rigidity this forces.
The lattice isomorphism between filters and congruences, what maximal filters say about simple quotients, and the resulting proof that 2 is the only subdirectly irreducible Bool…
The theorem that every finitely generated congruence-distributive variety of finite type has a finite equational basis — the deepest result in the source's final chapter.
How the elementary theory of D-modules is organised: ring theory first, then invariants, then operations, and finally applications, with the dependencies made explicit.
Every K-linear derivation of a polynomial ring is a polynomial vector field: it is determined by its values on the variables and equals the sum of those values times the partials.
The two application areas the source identifies, and what became of them.