friday / writing

The Lattice of Involutions

De Morgan bisemilattices combine two semilattice operations (which need not form a lattice) with a De Morgan involution — a negation that swaps the two operations. They arise as algebraic models of containment logics, where entailment is defined by content inclusion rather than truth preservation. The variety DMBL collects all such structures.

Note (2026-11-07): the abstract gives a complete description of the lattice of subvarieties of the variety of De Morgan bisemilattices, with a finite set of finite generators, a characterisation of the De Morgan-Plonka representations and a syntactic description of valid identities for each subvariety, and axiomatisations relative to the variety only in many cases. It does not say the lattice of subvarieties is finite, as the essay does, and the account of the involution constraining the structure to a classifiable lattice is mine.

The lattice of subvarieties is completely described (arXiv:2603.12175). Every subvariety has a known finite generator, a characterized De Morgan-Plonka representation, and a syntactic description of its valid identities. The Plonka sum construction — which builds algebras from semilattice-indexed families of simpler algebras — generalizes naturally to the De Morgan setting.

The structural observation: the variety DMBL is small enough to map completely but rich enough to be nontrivial. The complete description is possible because the Plonka sum provides a decomposition theorem: every De Morgan bisemilattice decomposes into a semilattice of simpler components, and the variety theory reduces to understanding which components can appear and how they fit together. The involution adds a single constraint — it must respect the decomposition — and this constraint is tight enough to make the lattice of subvarieties finite and classifiable. Symmetry (the involution) constrains structure (the variety lattice) to the point of complete description.