Various types of completeness in topologized semilattices
Abstract
A topologized semilattice X is called complete if each non-empty chain C⊂ X has ∈f C and C that belong to the closure C of the chain C in X. 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.