In combinatorial games, few results are known about the overall structure of multi-player games. We prove that given any finite set S of multi-player games, the set of games all of whose immediate options belong to S forms a completely distributive lattice with respect to every partial order relation ≤C, where C is an arbitrary coalition of players.

In combinatorial games, few results are known about the overall structure of multi-player games. We prove that n-player games born by day d forms a completely distributive lattice with respect to every partial order relation ≤C, where C is an arbitrary coalition of players.

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.

In the present paper we introduce and study L-pre-T0-, L-pre-T1-, L-pre-T2 (L-pre-Hausdorff)-, L-pre-T3 (L-preregularity)-, L-pre-T4 (L-pre-normality)-, L-pre-strong-T3-, L-pre-strong-T4-, L-pre-R0-, L-pre-R1-separation axioms in (2, L)-topologies where L is a complete residuated lattice. Sometimes we need more conditions on L such as the completely distributive law or that the ”∧” is distribut...

Rough sets, a tool for data mining, deal with the vagueness and granularity in information systems. Rough approximations on a complete completely distributive lattice(CCD lattice for short) and brings generalizations of rough sets into a unified framework are discussed in [3]. This paper is devoted to the discussion of the relationship between approximations and topologies on a CCD lattice. It ...

Let X be an infinite set of cardinality κ. We show that if L is an algebraic and dually algebraic distributive lattice with at most 2 completely join irreducibles, then there exists a monoidal interval in the clone lattice on X which is isomorphic to the lattice 1 + L obtained by adding a new smallest element to L. In particular, we find that if L is any chain which is an algebraic lattice, and...

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...

This paper proposes to study the lattice properties of two closed binary operations in the set of discrete fuzzy numbers. Using these operations to represent the meet and the join, we prove that the set of discrete fuzzy numbers whose support is a set of consecutive natural numbers is a distributive lattice. Finally, we demonstrate that the subsets of discrete fuzzy numbers, which have the same...

It is well known that the only simple distributive lattice is the twoelement chain. We can generalize the concept of a simple lattice to complete lattices as follows: a complete lattice is complete-simple if it has only the two trivial complete congruences. In this paper we show the existence of infinite complete-simple distributive lattices. “COMPLETE-SIMPLE” DISTRIBUTIVE LATTICES G. GRÄTZER A...

In this paper, we introduce and study the stable topology on the set of prime filters of a bounded 0-distributive lattice. The stable topology is a subtopology of the hull kernel topology on the set of prime filters of a bounded 0-distributive lattice. Sufficient condition is given under which the hull kernel topology and stable topology coincide on the set of prime filters (the set of maximal ...