Results 1 to 10 of about 184 (184)
Automorphisms and Definability (of Reducts) for Upward Complete Structures
Mathematics, 2022 The Svenonius theorem establishes the correspondence between definability of relations in a countable structure and automorphism groups of these relations in extensions of the structure.
Alexei Semenov, Sergei Soprunov
doaj +1 more source
On complete congruence lattices of complete lattices [PDF]
Transactions of the American Mathematical Society, 1991 The lattice of all complete congruence relations of a complete lattice is itself a complete lattice. In this paper, we characterize this lattice as a complete lattice. In other words, for a complete lattice L L
Grätzer, G., Lakser, H.
openaire +2 more sources
ON COMPLETE CONGRUENCE LATTICES OF COMPLETE MODULAR LATTICES [PDF]
International Journal of Algebra and Computation, 1991 The lattice of all complete congruence relations of a complete lattice is itself a complete lattice. In 1988, the second author announced the converse: every complete lattice L can be represented as the lattice of complete congruence relations of some complete lattice K.
Ralph Freese +2 more
openaire +1 more source
Complete relations on fuzzy complete lattices [PDF]
Fuzzy Sets and Systems, 2017 Preprint submitted to Fuzzy Sets and ...
Jan Konecny 0001, Michal Krupka
openaire +3 more sources
Completely representable lattices [PDF]
Algebra universalis, 2012 It is known that a lattice is representable as a ring of sets iff the lattice is distributive. CRL is the class of bounded distributive lattices (DLs) which have representations preserving arbitrary joins and meets. jCRL is the class of DLs which have representations preserving arbitrary joins, mCRL is the class of DLs which have representations ...
Egrot, R, Hirsch, R
openaire +3 more sources
Complete Congruence Lattices of Complete Distributive Lattices
Journal of Algebra, 1995 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
Reflective Full Subcategories of the Category of L-Posets
Abstract and Applied Analysis, 2012 This paper focuses on the relationship between L-posets and complete L-lattices from the categorical view. By considering a special class of fuzzy closure operators, we prove that the category of complete L-lattices is a reflective full subcategory of ...
Hongping Liu, Qingguo Li, Xiangnan Zhou
doaj +1 more source
Polarity in a Completely Distributive Complete Lattice [PDF]
Proceedings of the American Mathematical Society, 1988 We introduce p p -bases in completely distributive complete polarity lattices and give a procedure for generating these ...
openaire +1 more source
FUZZY CONNECTIONS AND COMPLETENESS IN COMPLETE RESIDUATED LATTICES [PDF]
Korean Journal of Mathematics, 2013 Summary: In this paper, we investigate the properties of fuzzy Galois (dual Galois, residuated, dual residuated) connections in a complete residuated lattice \(L\).
Kim, Yong Chan, Kim, Young Sun
openaire +2 more sources
“Complete-simple” distributive lattices [PDF]
Proceedings of the American Mathematical Society, 1993 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