We introduce the notion of a sturdy frame of abstract algebras which is a common generalization of a sturdy semilattice of semigroups, the sum of lattice ordered systems, the strong distributive lattice of semirings, the sturdy frame of type (2, 2) algebras and the strong b-lattice of semirings. Also, we give some properties and characterizations of the sturdy frame of abstract algebras. As an ...

Let £ be a $0$-distributive lattice with the least element $0$, the greatest element $1$, and ${rm Z}(£)$ its set of zero-divisors. In this paper, we introduce the total graph of £, denoted by ${rm T}(G (£))$. It is the graph with all elements of £ as vertices, and for distinct $x, y in £$, the vertices $x$ and $y$ are adjacent if and only if $x vee y in {rm Z}(£)$. The basic properties of the ...

We establish a topological duality for bounded lattices. The two main features of our duality are that it generalizes Stone duality for bounded distributive lattices, and that the morphisms on either side are not the standard ones. A positive consequence of the choice of morphisms is that those on the topological side are functional. Towards obtaining the topological duality, we develop a unive...

If L is a lattice, the automorphism group of L is denoted Aut(L). It is known that given a finite abstract group H, there exists a finite distributive lattice D such that Aut(D) £= H. It is also known that one cannot expect to find a finite orthocomplemented distributive (Boolean) lattice B such that Aut(B) s= H. In this paper it is shown that there does exist a finite orthomodular lattice L su...

The covering relation in the lattice of subuniverses of a finite distributive lattice is characterized in terms of how new elements in a covering sublattice fit with the sublattice covered. In general, although the lattice of subuniverses of a finite distributive lattice will not be modular, nevertheless we are able to show that certain instances of Dedekind’s Transposition Principle still hold...

We give a new characterization of sober spaces in terms of their completely distributive lattice of saturated sets. This characterization is used to extend Abramsky's results about a domain logic for transition systems. The Lindenbaum algebra generated by the Abramsky nitary logic is a distributive lattice dual to an SFP-domain obtained as a solution of a recursive domain equation. We prove tha...

The Semi Heyting Almost Distributive Lattice (SHADL) is a mathematical framework that combines the concepts of semi algebra and almost distributive lattice. This abstract highlights applications SHADL in various domains

We prove that every distributive algebraic lattice with at most א1 compact elements is isomorphic to the normal subgroup lattice of some group and to the submodule lattice of some right module. The א1 bound is optimal, as we find a distributive algebraic lattice D with א2 compact elements that is not isomorphic to the congruence lattice of any algebra with almost permutable congruences (hence n...

We prove that every finite distributive lattice can be represented as the congruence lattice of a finite (planar) semimodular lattice.