2016/09/14 by Lawrence Valby, Valby, Lawrence
Computer Science · Decision Sciences · Mathematics · #Advanced Topology and Set Theory #FOS: Mathematics #Fuzzy and Soft Set Theory #Logic (math.LO) #math.LO #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1609.04440
7 pages, 4 figures
arxiv created 2016/09/14 · openalex publication_date 2016/09/14 · arxiv updated 2016/09/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We investigate a certain class of posets arising from semilattice actions. Let S be a semilattice with identity. Let S act on a set C. For c,d∈ C put c≤ d iff there is some s∈ S with ds=c. Then (C,≤) is a poset. Let's call the posets that arise in this way \downarrow-posets. We give a reasonable second order characterization of \downarrow-posets and show that there is no first order characterization.