Results 11 to 20 of about 218 (206)
Countably QC-Approximating Posets [PDF]
As a generalization of countably C-approximating posets, the concept of countably QC-approximating posets is introduced. With the countably QC-approximating property, some characterizations of generalized completely distributive lattices and generalized ...
Xuxin Mao, Luoshan Xu
doaj +2 more sources
Invariant functionals on completely distributive lattices [PDF]
In this paper we are interested in functionals defined on completely distributive lattices and which are invariant under mappings preserving {arbitrary} joins and meets. We prove that the class of nondecreasing invariant functionals coincides with the class of Sugeno integrals associated with $\{0,1\}$-valued capacities, the so-called term functionals,
Marta Cardin, MIGUEL Couceiro
exaly +5 more sources
Structure of completely distributive complete lattices
A lattice with 0 is called dense if 0 is meet-irreducible. The author proves the following simple theorem: If L is a non trivial dense complete chain, the lattice morphisms from L to I (the real unit interval, with the usual order) separate the points (for every ...
exaly +3 more sources
Equalizers and Coequalizers in the Category of Topological Molecular Lattices [PDF]
A completely distributive complete lattice is called a molecular lattice. It is well known that the category TML of all topological molecular lattices with generalized order homomorphisms in the sense of Wang, is both complete and cocomplete.
Ghasem Mirhosseinkhani, Narges Nazari
doaj +1 more source
On generalized topological molecular lattices [PDF]
In this paper, we introduce the concept of the generalized topological molecular lattices as a generalization of Wang's topological molecular lattices, topological spaces, fuzzy topological spaces, L-fuzzy topological spaces and soft topological spaces.
Narges Nazari, Ghasem Mirhosseinkhani
doaj +1 more source
“Complete-simple” distributive lattices [PDF]
It is well known that the only simple distributive lattice is the two-element 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.
Grätzer, G., Schmidt, E. T.
openaire +1 more source
Structure of completely distributive complete lattices
exaly +3 more sources
Classes of completely distributive complete lattices
exaly +3 more sources
Complete Congruence Lattices of Complete Distributive Lattices
The authors deal with the question of whether every complete lattice \(L\) is isomorphic to the lattice of complete congruence relations of a suitable complete lattice \(K\). They prove that \(K\) can always be chosen as a complete distributive lattice. In fact, they prove a more general result: Let \(m\) be a regular cardinal \(>\aleph_ 0\). Every \(m\
Gratzer, G., Schmidt, E.T.
openaire +2 more sources
Polarity in a Completely Distributive Complete Lattice [PDF]
We introduce p p -bases in completely distributive complete polarity lattices and give a procedure for generating these ...
openaire +1 more source

