2000 character limit reached
Semilattices with a congruence
Published 11 Jul 2024 in math.RA | (2407.08446v1)
Abstract: A specialization semilattice is a semilattice together with a coarser preorder satisfying a compatibility condition. We show that the category of specialization semilattices is isomorphic to the category of semilattices with a congruence, hence equivalent to the category of semilattice epimorphisms. Guided by the above example, we hint to an ``internal'' characterization of surjective homomorphisms between general relational systems.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.