On $\mathscr{H}$-complete topological semilattices
S. Bardyla, O. Gutik

TL;DR
This paper investigates the structure of $\\mathscr{H}$-completions of certain discrete semilattices, providing new examples and counterexamples that clarify the distinctions between different types of topological semilattices.
Contribution
It characterizes $\\mathscr{H}$-completions of specific semilattices and constructs examples showing the non-equivalence of $\\mathscr{H}$-completeness and $\\mathscr{AH}$-completeness.
Findings
An example of an $\\mathscr{H}$-complete semilattice not $\\mathscr{AH}$-complete.
Construction of a large $\\mathscr{H}$-complete semilattice with many non-$\mathscr{H}$-complete images.
Negative answer to a question about the equivalence of $\\mathscr{H}$-completeness and $\\mathscr{AH}$-completeness.
Abstract
In the paper we describe the structure of -completions and -completions of the discrete semilattices and . We give an example of an -complete topological semilattice which is not -complete. Also we construct an -complete topological semilattice of cardinality which has many open-and-closed continuous homomorphic images which are not -complete topological semilattices. The constructed examples give a negative answer to Question 17 from the paper J. W. Stepp, {\it Algebraic maximal semilattices}. Pacific J. Math. {\bf 58}:1 (1975), 243-248.
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
Topicssemigroups and automata theory · Advanced Algebra and Logic · Computability, Logic, AI Algorithms
