Various types of completeness in topologized semilattices
Konstantin Kazachenko, Alexander V. Osipov

TL;DR
This paper explores different notions of completeness in topologized semilattices, introducing new concepts, analyzing their properties, and providing examples to distinguish these classes, thereby extending existing results in the field.
Contribution
It introduces various new concepts of completeness in topologized semilattices using generalized closure operators and studies their fundamental properties and distinctions.
Findings
Different classes of completeness do not coincide.
New theorems generalize results on complete semilattices with topology.
Examples illustrate the distinctions among the classes.
Abstract
A topologized semilattice is called complete if each non-empty chain has and that belong to the closure of the chain in . In this paper, we introduce various concepts of completeness of topologized semilattices in the context of operators that generalize the closure operator, and study their basic properties. In addition, examples of specific topologized semilattices are given, showing that these classes do not coincide with each other. Also in this paper, we prove theorems that allow us to generalize the available results on complete semilattices endowed with topology.
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 · Fuzzy and Soft Set Theory · Advanced Topology and Set Theory
