𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complete Congruence Lattices of Complete Distributive Lattices

✍ Scribed by G. Gratzer; E.T. Schmidt


Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
984 KB
Volume
171
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.

✦ Synopsis


In 1983. Wille raised the question: Is elery complete lattice (L) isomorphic to the lattice of complete congruence relations of a suitable complete lattice K? In 1988 . this was answered in the affirmative by the first author. A number of papers have been published on this problem by Freese, Johnson, Lakser, Teo, and the authors. In the present paper we prove that (K) can always be chosen as a complete distributive lattice. In fact, we prove the following more general result:

Tireorem. Let in be a regular cardinal (>\mathbf{N}_{0}). Eiery m-algetraic lattice (L) can be represented as the lattice of it-complete congruence relations of an (\mathrm{tt}-) complete distributitice lattice (K . w 1995) Academic Press. Inc.


πŸ“œ SIMILAR VOLUMES


A topological characterization of comple
✍ Lucian Beznea πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 181 KB

An ordered compact space is a compact topological space X, endowed with a partially ordered relation, whose graph is a closed set of X x X (of. [4]). An important subclass of these spaces is that of Priest/ey spaces, characterized by the following property: for every x, y ~X with x~y there is an inc

Connectivity on Complete Lattices: New R
✍ Ulisses Braga-Neto; John Goutsias πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 451 KB

The notion of connectivity is very important in image processing and analysis, and particularly in problems related to image segmentation. It is well understood, however, that classical notions of connectivity, including topological and graph-theoretic notions, are not compatible with each other. Th