  We investigate effective properties of uncountable free abelian groups. We
show that identifying free abelian groups and constructing bases for such
groups is often computationally hard, depending on the cardinality. For
example, we show, under the assumption $V=L$, that there is a first-order
definable free abelian group with no first-order definable basis.
