2002/08/19 by Martin Goldstern, Goldstern, Martin
Computer Science · Mathematics · #16Y60 #18A40 #Advanced Algebra and Logic #FOS: Mathematics #Logic, programming, and type systems #Rings and Algebras (math.RA) #math.RA #msc:16Y60 #msc:18A40 #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.math/0208134
This is an English summary of my 1985 (unpublished) diploma thesis
arxiv created 2002/08/19 · openalex publication_date 2002/08/19 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A semiring can be ``completed'' (i.e., embedded into a semiring in which all infinite sums are defined and satisfy some reasonable properties) iff this semiring can be naturally partially ordered. This construction is ``natural'' (a left adjoint to the forgetful functor), and quite straightforward.