All Questions

Is there a way to axiomatize [non-abelian] free groups in first-order logic using the language of groups (which contains the binary operation symbol $\cdot$, and the constant symbol $e$)? Is there ...

Let $w$ be a word in a free group $F_2$ of two generators $x_1, x_2$ such that there does not exist any endomorphism of free group which takes $w$ to $w^{-1}$. Let $w_1, w_2$ be two words in the same ...