Abstract
For a complete lattice C, we consider the problem of establishing when the complete lattice of complete congruence relations on C is a complete sublattice of the complete lattices of join- or meet-complete congruence relations on C. We first argue that this problem is not trivial, and then we show that it admits an affirmative answer whenever C is continuous for the join case and, dually, co-continuous for the meet case. As a consequence, we prove that if C is continuous then each principal filter generated by a continuous complete congruence on C is pseudocomplemented.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 189-200 |
| Number of pages | 12 |
| Journal | Algebra Universalis |
| Volume | 40 |
| Issue number | 2 |
| DOIs | |
| State | Published - 1998 |
| Externally published | Yes |
Keywords
- Closure operator
- Complete congruence
- Complete lattice
- Continuous complete lattice
- Join- and meet-complete congruence
- Meet-continuous complete lattice
- Pseudocomplement
ASJC Scopus subject areas
- Algebra and Number Theory
Fingerprint
Dive into the research topics of 'Some properties of complete congruence lattices'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS