Regular \(S\)-acts with primitive normal and antiadditive theories (Q1930239)

Let \(T\) be a complete first-order theory of a language \(L\). If \(\mathcal A\) is a model of \(T\), and \(\Phi(\bar{x},\bar{y})\) a formula of \(L\), then \(\Phi({\mathcal A}, \bar{a})\) denotes the set \(\{ \bar{b}\mid{\mathcal A}\models \Phi(\bar{b},\bar{a})\}\), where \(\bar{z}\) denotes an \(n\)-tuple \(\langle z_0,\ldots, z_{n-1}\rangle\). A formula of the form \(\exists \bar{x}(\Phi_0\wedge\ldots\wedge\Phi_k)\), where \(\Phi_i\) are atomic formulas, is called a primitive formula. If \(\Phi(\bar{x},\bar{y})\) is a primitive formula, then \(\Phi({\mathcal A}, \bar{a})\) is called a primitive set. The sets \(\Phi({\mathcal A}, \bar{a})\) and \(\Phi({\mathcal A}, \bar{b})\) are called primitive copies. A theory \(T\) is called primitive normal if, for all primitive copies \(X\) and \(Y\), either \(X=Y\) or \(X\cap Y=\emptyset\). An axiomatizable class of structures of a language \(L\) is called primitive normal if the theory of this class is primitive normal. A subclass of a class of primitive normal structures satisfying a certain additional condition on primitive sets is called antiadditive. Let \(S\) be a monoid and let \(R\) be the union of all regular subacts of \(_SS\). The authors present a description of a primitive normal \(S\)-act. It is proved that if \(S\) is a commutative monoid and the class \(\Re\) of regular \(S\)-acts is axiomatizable, then the following three conditions are equivalent: 1) the class \(\Re\) is primitive normal, 2) the class \(\Re\) is antiadditive, 3) the semigroup \(R\) is linearly ordered.