Related papers: Join-semilattices whose principal filters are pseu…
A mixed lattice is a lattice-type structure consisting of a set with two partial orderings, and generalizing the notion of a lattice. Mixed lattice theory has previously been studied in various algebraic structures, such as groups and…
We review the notion of (finitary) filter pair as a tool for creating and analyzing logics. A filter pair can be seen as a presentation of a logic, given by presenting its lattice of theories as the image of a lattice homomorphism, with…
We characterize those semilattices that give rise to Boolean spaces on their associated spaces of ultrafilters. The class of 0-disjunctive semilattices, important in the theory of congruence-free inverse semigroups, plays a distinguished…
Crisp and lattice-valued ambiguous representations of one continuous semilattice in another one are introduced and operation of taking pseudo-inverse of the above relations is defined. It is shown that continuous semilattices and their…
A specialization semilattice is a semilattice together with a coarser preorder satisfying a compatibility condition. We show that the category of specialization semilattices is isomorphic to the category of semilattices with a congruence,…
A general result by Jackson (Flat algebras and the translation of universal Horn logic to equational logic, J. Symb. Log. 73(1) (2008) 90--128) implies that the lattice of all quasivarieties of groups of exponent dividing $n$ embeds into…
A join-semilattice $L$ is said to be conjunctive if it has a top element $1$ and it satisfies the following first-order condition: for any two distinct $a,b\in L$, there is $c\in L$ such that either $a\vee c\not=1=b\vee c$ or $a\vee…
Join-distributive lattices are finite, meet-semidistributive, and semimodular lattices. They are the same as Dilworth's lattices in 1940, and many alternative definitions and equivalent concepts have been discovered or rediscovered since…
We construct a diagram D, indexed by a finite partially ordered set, of finite Boolean semilattices and (v,0,1)-embeddings, with top semilattice $2^4$, such that for any variety V of algebras, if D has a lifting, with respect to the…
We represent finite join-semilattices and join-preserving morphisms as a category whose objects and morphisms are binary relations. It is a quotient category of $\mathsf{Rel}_f$'s arrow category, where self-duality arises by taking the…
We introduce and characterize various gluing constructions for residuated lattices that intersect on a common subreduct, and which are subalgebras, or appropriate subreducts, of the resulting structure. Starting from the 1-sum construction…
We begin a systematic study of finite semigroups that generate join irreducible members of the lattice of pseudovarieties of finite semigroups, which are important for the spectral theory of this lattice. Finite semigroups $S$ that generate…
In this paper, we show that given a weakly dicomplemented lattice (WDL) $\mathcal{L}=(L; \vee, \wedge, ^{\Delta}, ^{\nabla}, 0, 1)$, $^{\Delta}$ induces a structure of a dual weakly complemented lattice in the lattice $(F(L), \subseteq)$ of…
Various embedding problems of lattices into complete lattices are solved. We prove that for any join-semilattice S with the minimal join-cover refinement property, the ideal lattice IdS of S is both algebraic and dually algebraic.…
Information algebras arise from the idea that information comes in pieces which can be aggregated or combined into new pieces, that information refers to questions and that from any piece of information, the part relevant to a given…
We characterize factor congruences in semilattices by using generalized notions of order ideal and of direct sum of ideals. When the semilattice has a minimum (maximum) element, these generalized ideals turn into ordinary (dual) ideals.
We characterize well-founded algebraic lattices by means of forbidden subsemilattices of the join-semilattice made of their compact elements. More specifically, we show that an algebraic lattice $L$ is well-founded if and only if $K(L)$,…
We characterize commutative idempotent involutive residuated lattices as disjoint unions of Boolean algebras arranged over a distributive lattice. We use this description to introduce a new construction, called gluing, that allows us to…
We characterize conservative median algebras and semilattices by means of forbidden substructures and by providing their representation as chains. Moreover, using a dual equivalence between median algebras and certain topological…
Since for the classification of finite (congruence-)simple semirings it remains to classify the additively idempotent semirings, we progress on the characterization of finite simple additively idempotent semirings as semirings of…