Finite first-order recognition of freeness from subsemigroup lattices

Let \( L(S)\) be the lattice of all subsemigroups of a nonempty semigroup \(S\), including the empty subsemigroup. There are sentences \(Φfr\) and \(Φab\) in the language \(\{,\}\) such that \( L(S)Φfr\) exactly when \(S\) is a free group, and \( L(S)Φab\) exactly when \(S\) is a free abelian group. The ranks are arbitrary, including zero. The abelian sentence uses a reduced positive cone with prime irreducibles. For free groups, subsemigroup cuts detect a free basis, while an unordered-product relation determines multiplication up to reversal. An oriented noncommuting pair and Beth's definability theorem eliminate the temporary multiplication relation. These finite axiomatizations give affirmative answers to both parts of Kourovka Problem 2.81.