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

In the early eighties, A. Huhn proved that if D, E are finite distributive lattices and ψ : D → E is a {0}-preserving join-embedding, then there are finite lattices K, L and there is a lattice homomorphism φ : K → L such that ConK (the congruence lattice of K) is isomorphic to D, ConL (the congruence lattice of L) is isomorphic to E, and the natural induced mapping extφ : ConK → ConL represents...

Given a reference lattice (X,⊑), we define fuzzy intervals to be the fuzzy sets such that their pcuts are crisp closed intervals of (X,⊑). We show that: given a complete lattice (X,⊑) the collection of its fuzzy intervals is a complete lattice. Furthermore we show that: if (X,⊑) is completely distributive then the lattice of its fuzzy intervals is distributive.

A locally modular (resp. locally distributive) lattice is a lattice with a congruence relation and each of whose equivalence class has sufficiently many elements and is a modular (resp. distributive) sublattice. Both the lattice of all closed subspaces of a locally convex space and the lattice of projections of a locally finite von Neumann algebra are locally modular. The lattice of all /^-topo...

Let Pw and PM be the countable distributive lattices of Muchnik and Medvedev degrees of non-empty Π1 subsets of 2 , under Muchnik and Medvedev reducibility, respectively. We show that all countable distributive lattices are lattice-embeddable below any non-zero element of Pw. We show that many countable distributive lattices are lattice-embeddable below any non-zero element of PM .

This paper surveys recent developments in the theory of profinite Heyting algebras (resp. bounded distributive lattices, Boolean algebras) and profinite completions of Heyting algebras (resp. bounded distributive lattices, Boolean algebras). The new contributions include a necessary and sufficient condition for a profinite Heyting algebra (resp. bounded distributive lattice) to be isomorphic to...

A prime algebraic lattice can be characterised as isomorphic to the downwards-closed subsets, ordered by inclusion, of its complete primes. It is easily seen that the downwards-closed subsets of a partial order form a completely distributive algebraic lattice when ordered by inclusion. The converse also holds; any completely distributive algebraic lattice is isomorphic to such a set of downward...

In the late 1930's Garrett Birkhoff [3] pioneered the theory of distributive lattices. An important component in this theory is the concept of exponentiation of lattices [4]: for a lattice L and a partially ordered set P let L denote the set of all order-preserving maps of P to L partially ordered b y / ^ g if and only if/(;c) ^ g(x) for each x e P (see Figure 1). Indeed, If is a lattice. This ...