A semiring variety is d-semisimple if it is generated by the distributive lattice of order two and a finite number of finite fields. A d-semisimple variety V = HSP{B2, F1, . . . , Fk} plays the main role in this paper. It will be proved that it is finitely based, and that, up to isomorphism, the two-element distributive lattice B2 and all subfields of F1, . . . , Fk are the only subdirectly irr...

Distributive supermatroids generalize matroids to partially ordered sets. Completing earlier work of Barnabei, Nicoletti and Pezzoli we characterize the lattice of flats of a distributive supermatroid. For the prominent special case of a polymatroid the description of the flat lattice is particularly simple. Large portions of the proofs reduce to properties of weakly submodular rank functions. ...

We show that a nite distributive lattice can be embedded into the r.e. degrees preserving least and greatest element i the lattice contains a join-irreducible noncappable element.

In this paper the authors have studied the Glivenko congruence R in a 0-distributive nearlattice S defined by " () R b a ≡ if and only if 0 = ∧ x a is equivalent to 0 = ∧ x b for each S x ∈ ". They have shown that the quotient nearlattice R S is weakly complemented. Moreover, R S is distributive if and only if S is 0-distributive. They also proved that every Sectionally complemented nearlattice...

the aim of this paper is to establish a fuzzy version of the dualitybetween domains and completely distributive lattices. all values aretaken in a fixed frame $l$. a definition of (strongly) completelydistributive $l$-ordered sets is introduced. the main result inthis paper is that the category of fuzzy domains is dually equivalentto the category of strongly completely distributive $l$-ordereds...

From a well-known decomposition theorem, we propose a tree representation for distributive and simplicial lattices. We show how this representation (called ideal tree) can be efficiently computed (linear time in the size of the lattice given by any graph whose transitive closure is the lattice) and compared with respect to time and space complexity. As far as time complexity is concerned, we si...

In the early forties, R. P. Dilworth proved his famous result: Every finite distributive lattice D can be represented as the congruence lattice of a finite lattice L. In one of our early papers, we presented the first published proof of this result; in fact we proved: Every finite distributive lattice D can be represented as the congruence lattice of a finite sectionally complemented lattice L....