Annals of Pure and Applied Logic 141 (2006) 61-78. doi:10.1016/j.apal.2005.10.002Received by publisher: 2005-06-13Harvest Date: 2016-01-04 12:21:35DOI: 10.1016/j.apal.2005.10.002Page Range: 61-7

We consider countable free groups of different ranks. For these groups, we investigate computability theoretic complexity of index sets within the class of free groups and within the class of all groups. For a computable free group of infinite rank, we consider the difficulty of finding a basis.

No abstract

No abstract