Two questions:


1. Suppose *a* and *b* are two uncountable cardinals. Consider the symmetric groups on sets of sizes *a* and *b* respectively (the symmetric group on a set is the group of all bijections from the set to itself, under composition). Consider the first-order theories of these as "pure groups" (i.e., just the group structure, no additional information). Are these elementarily equivalent? (does the answer change if we allow one of *a* or *b* to be the countable cardinal?)
2. Suppose $a\_1$, $a\_2$, $b\_1$ and $b\_2$ are uncountable cardinals with $a\_1 < a\_2$ and $b\_1 < b\_2$. Consider the symmetric group on a set of size $a\_2$ and the subgroup of those bijections that have support of size at most $a\_1$. Consider the pure theory of this group-subgroup pair (i.e., the pure theory of the group along with a membership predicate for the subgroup). Similarly, for $b\_1$ and $b\_2$. Are these two pure theories elementarily equivalent? Does the answer change if, instead, we look at the subgroup of those bijections that have support of size strictly less than $a\_1$? Does the answer change if we allow the countable cardinal? (The support of a bijection is the set of elements that are moved).


By the Baer-Schreier-Ulam theorem, the only normal subgroups of symmetric groups on infinite sets are the subgroups comprising bijections with support of size strictly less than *a* for some infinite cardinal *a* or the subgroups comprising bijections with support of size less than or equal to *a* for some infinite cardinal *a*, plus the trivial subgroup and the finitary alternating group. All these are also characteristic subgroups. 


If (2) is true, this would give examples of distinct characteristic subgroups of the same group that are elementarily equivalently embedded as subgroups (i.e., there is no first-order sentence true for one subgroup that is not true for the other).



elementary equivalence of infinitary symmetric groups
For each ordinal $\alpha < \omega^\omega$ the symmetric group on $\aleph\_{\alpha}$ is first order definable in the class of all symmetric groups; i.e. there is a sentence in the first order language of groups that is true in $Sym(A)$ iff $|A| = \aleph\_\alpha$. See Mckenzie - On elementary types of symmetric groups, Algebra Universalis 1 (1971), 13--20.


Shelah provides an interesting necessary and sufficient condition for the elementary equivalence of $Sym(\aleph\_\alpha)$ and $Sym(\aleph\_\beta)$ - First order theory of permutation groups, Israel J. Math. 14 (1973), 149–162; corrections: ibid. 15 (1973), 437–44.


