Unbounded distributive lattices which have strong endomorphism kernel property (SEKP) introduced by Blyth and Silva in [3] were fully characterized in [11] using Priestley duality (see Theorem  2.8}). We shall determine the structure of special elements (which are introduced after  Theorem 2.8 under the name strong elements) and show that these lattices can be considered as a direct product of ...

The core of a cooperative game on a set of players N is one of the most popular concept of solution. When cooperation is restricted (feasible coalitions form a subcollection F of 2 ), the core may become unbounded, which makes it usage questionable in practice. Our proposal is to make the core bounded by turning some of the inequalities defining the core into equalities (additional efficiency c...

In this paper, the concepts of $L$-concave structures, concave $L$-interior operators and concave $L$-neighborhood systems are introduced. It is shown that the category of $L$-concave spaces and the category of concave $L$-interior spaces are isomorphic, and they are both isomorphic to the category of concave $L$-neighborhood systems whenever $L$ is a completely distributive lattice. Also, it i...

The least element 0 of a finite meet semi-distributive lattice is a meet of meet-prime elements. We investigate conditions under which the least element of an algebraic, meet semi-distributive lattice is a (complete) meet of meet-prime elements. For example, this is true if the lattice has only countably many compact elements, or if |L| < 2א0 , or if L is in the variety generated by a finite me...

By a lattice we shall always mean a distributive lattice which is bounded, i.e. has both a bottom element 0 and a top element 1. Lattice homomorphisms will always be assumed to preserve 0 and 1. By a modality on a (distributive) lattice L = (L, ∧, ∨, ≤, 0, 1) is meant a map : L → L satisfying (1) 1 = 1, (2) (x ∧ y) = x ∧ y for x, y ∈ L. The pair (L, ) will be called a modalized (distributive) l...

this paper extends the notion of ditopology to the case where openness and closedness are given in terms of {em a priori} unrelated drading functions. the resulting notion of graded ditopology is considered both in the setting of lattices and in that textures, the relation between the two approaches being discussed in detail. interrelations between graded ditopologies and ditopologies on textur...

We characterize the distributive lattices of Jacobson rings and prove that if a semiring is a distributive lattice of Jacobson rings, then, up to isomorphism, it is equal to the subdirect product of a distributive lattice and a Jacobson ring. Also, we give a general method to construct distributive lattices of Jacobson rings.

The free distributive completion of a partial complete lattice is the complete lattice that it is freely generated by the partial complete latticèin the most distributive way'. This can be described as being a universal solution in the sense of universal algebra. Free distributive completions generalize the constructions of tensor products and of free completely distributive complete lattices o...

An rj-normal lattice is a distributive lattice with 0 such that each prime ideal contains at most n minimal prime ideals. A relatively ra-normal lattice is a distributive lattice such that each bounded closed interval is an /¡.-normal lattice. The main results of this paper are: (1) a distributive lattice L with 0 is 71,-normal if and only if for any %n, x,,*•', X e L such that x Ax. = 0 for an...