On disjunction of equations in the semigroup language with no constants
Artem N. Shevlyakov

TL;DR
This paper proves that in the language of semigroups without constants, no nontrivial semigroup can be an equational domain, meaning finite unions of algebraic sets are not algebraic in such structures.
Contribution
It establishes a fundamental limitation on the algebraic structure of semigroups in the standard language, showing they cannot be equational domains.
Findings
No nontrivial semigroup is an equational domain in the standard semigroup language.
Finite unions of algebraic sets are not algebraic in nontrivial semigroups.
The result clarifies the algebraic properties of semigroups without constants.
Abstract
A semigroup is an equational domain if any finite union of algebraic sets over is algebraic. We prove that every nontrivial semigroup in the standard language is not an equational domain.
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 · Polynomial and algebraic computation · Advanced Topology and Set Theory
