Abstract:
We prove the algorithmic undecidability of several simple fragments of the positive theories of free noncyclic semigroups, consisting of positive formulas with simple quantifier prefixes and with a small number of constants in their quantifier-free part.