The paper discusses “regularisation” of dualities. A given duality between (concrete) categories, e.g. a variety of algebras and a category of.
These semilattice dualities may be viewed as regu of (trivial) duality for trivial algebras. Semilattice duality is the regularization of other dualities. The ...
The paper discusses regularisation of dualities. A given duality between (concrete) categories, e.g. a variety of algebras and a category of representation ...
The paper discusses regularisation of dualities. A given duality between (concrete) categories, e.g. a variety of algebras and a category of representation ...
Duality for semilattice representations · The Pontryagin Duality of Compact O-Dimensional Semilattices and Its Applications · Representation of Distributive ...
Aug 16, 1994 · These semilattice dualities may be viewed as regularizations of (trivial) duality for trivial algebras. Semilattice duality is the basis for.
Abstract. While every finite lattice-based algebra is dualisable, the same is not true of semilattice-based algebras. We show that a finite semilattice- ...
Oct 22, 2024 · While every finite lattice-based algebra is dualisable, the same is not true of semilattice-based algebras.
This article reports on a monograph in which the authors discuss the duality between the category S_ of semilattices with identity and identity preserving ...
Dually, a meet-semilattice (or lower semilattice) is a partially ordered set which has a meet (or greatest lower bound) for any nonempty finite subset. Every ...
Missing: based | Show results with:based