Let D be the ordered set of isomorphism types of finite distributive lattices, where the ordering is by embeddability. We study first-order definability in this ordered set. We prove among other things that for every finite distributive lattice D, the set {d, d} is definable, where d and d are the isomorphism types of D and its opposite (D turned upside down). We prove that the only non-identit...

employing the notions of the strong $l$-topology introduced by zhangand the $l$-frame introduced by yao  and the concept of $l$-enrichedtopological system defined in the present paper, we constructadjunctions among the categories {bf st$l$-top} of strong$l$-topological spaces, {bf s$l$-loc} of strict $l$-locales and{bf $l$-entopsys} of $l$-enriched topological systems. all of theseconcepts are ...

The normal, or Dedekind-MacNeille, completion δ(L) of a distributive lattice L need not be distributive. However, δ(L) does contain a largest distributive sublattice β(L) containing L, and δ(L) is distributive if and only if β(L) is complete if and only if δ(L) = β(L). In light of these facts, it may come as a surprise to learn that β(L) was developed (in [1]) for reasons having nothing to do w...

First, we establish a useful characterization of effective sets in conditionally complete partially ordered sets. Then, we prove that each maximal nonexpansive partial multiplier on a conditionally complete and infinitely distributive partially ordered set with upper bounded centre is inner. Finally, we show that some analogous results hold for T1-families of sets partially ordered by inclusion.

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

S OF PAPERS SUBMITTED FOR PRESENTATION TO THE SOCIETY The following papers have been submitted to the Secretary and the Associate Secretaries of the Society for presentation at meetings of the Society. They are numbered serially throughout this volume. Cross references to them in the reports of the meetings will give the number of this volume, the number of this issue, and the serial number of ...

1. Introduction. A typical result of this paper is the following. Let Lt, i e I be distributive lattices satisfying the countable chain condition. Then the free product L of these lattices also satisfies the countable chain condition. To be able to state the general result we need some notations. Let trt be an infinite cardinal. A poset (partially ordered set) P is said to satisfy the m-chain c...

Let L be a lattice ordered effect algebra. We prove that the lattice uniformities on L which make uniformly continuous the operations ⊖ and ⊕ of L are uniquely determined by their system of neighbourhoods of 0 and form a distributive lattice. Moreover we prove that every such uniformity is generated by a family of weakly subadditive [0,+∞]-valued functions on L.

in this paper, countable compactness and the lindel¨of propertyare defined for l-fuzzy sets, where l is a complete de morgan algebra. theydon’t rely on the structure of the basis lattice l and no distributivity is requiredin l. a fuzzy compact l-set is countably compact and has the lindel¨ofproperty. an l-set having the lindel¨of property is countably compact if andonly if it is fuzzy compact. ...