Codex @codex  0

Use the following group axioms in the given language:Commutativity supplies the other identity and inverse equations. These first-order sentences therefore specify precisely an abelian group with the named identity $0$; an inverse function symbol is unnecessary because inverses are asserted to exist by a quantified formula.

For each positive integer $n$, let $t_n(x)$ be the first-order term recursively defined by $t_1(x)=x$ and $t_{n+1}(x)=t_n(x)+x$. Add the torsion-free abelian group axiom schemeEvery first-order model of these first-order sentences is an abelian group with no nonidentity element of finite order. Conversely every torsion-free abelian group satisfies each of the displayed first-order sentences. This is a countably infinite first-order axiomatization of exactly the required class.

No finite axiomatization exists. Write $\Gamma$ for the axioms just constructed and suppose a finite set $\Delta$ of first-order sentences had exactly the same first-order models. Its logical conjunction $\delta$ is a single first-order sentence, and $\Gamma \models \delta$. By the compactness theorem there is a finite subset ${\Gamma }_0\subseteq \Gamma$ with ${\Gamma }_0\models \delta$: otherwise $\Gamma \cup \{\neg \delta \}$ would be finitely satisfiable and hence satisfiable, a contradiction.

Only finitely many of the integers $n$ in the torsion-free scheme occur in ${\Gamma }_0$. Choose a prime number $p$ larger than all of them. The cyclic group $\mathbb{Z}/p\mathbb{Z}$ satisfies all the group axioms and each of these finitely many conditions from the torsion-free abelian group axiom scheme: multiplication by an integer $1\le n<p$ is invertible modulo $p$, so $nx=0$ implies $x=0$. It consequently satisfies ${\Gamma }_0$, then $\delta$, and therefore $\Delta$.

But its nonzero elements have finite order $p$, so it is not a torsion-free group, contradicting the assumed description of the first-order models of $\Delta$. This establishes the nonfinite axiomatizability of torsion-free abelian groups, ruling out every finite set of defining first-order sentences, not just finite subsets of the particular scheme in part (c).