Finding bases of uncountable free abelian groups is usually difficult
Logic
2017-09-08 v1
Abstract
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 , that there is a first-order definable free abelian group with no first-order definable basis.
Keywords
Cite
@article{arxiv.1709.02326,
title = {Finding bases of uncountable free abelian groups is usually difficult},
author = {Noam Greenberg and Dan Turetsky and Linda Brown Westrick},
journal= {arXiv preprint arXiv:1709.02326},
year = {2017}
}
Comments
26 pages