The ordered set of principal congruences of a countable lattice
Gabor Czedli

TL;DR
This paper extends Gratzer's characterization of principal congruence sets from finite to countable lattices, showing that certain ordered sets can be realized as principal congruences of some lattice.
Contribution
It generalizes Gratzer's results to countable lattices, establishing conditions under which an ordered set is isomorphic to the principal congruences of a lattice.
Findings
Characterization of principal congruence sets for countable lattices
Proof that certain unions of chains of order ideals correspond to principal congruences
Extension of bounded ordered set realizations to countable lattices
Abstract
For a lattice L, let Princ L denote the ordered set of principal congruences of L. In a pioneering paper, G. Gratzer characterized the ordered sets Princ L of finite lattices L; here we do the same for countable lattices. He also showed that each bounded ordered set H is isomorphic to Princ L of a bounded lattice L. We prove a related statement: if an ordered set H with least element is the union of a chain of principal order ideals, then H is isomorphic to Princ L of some lattice L.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · Rough Sets and Fuzzy Logic · Fuzzy and Soft Set Theory
