Describing free groups, Part II: $\Pi ^0_4$ hardness and no $\Sigma _{2}^{0}$ basis
HTML articles powered by AMS MathViewer
- by Charles McCoy and John Wallbaum PDF
- Trans. Amer. Math. Soc. 364 (2012), 5729-5734 Request permission
Abstract:
We continue the study of free groups from a computability theoretic perspective. In particular, we show that for $F_{\infty }$, the free group on a countable number of generators, the descriptions given in our preceding paper are the best possible.References
- M. Bestvina and M. Feighn, “Definable and negligible subsets of free groups”, in process.
- J. Carson, V. Harizanov, J. Knight, K. Lange, C. McCoy, A. Morozov, S. Quinn, C. Safranski, J. Wallbaum, “Describing free groups”, Tran. Amer. Math. Soc., this issue.
- B. Fine, G. Rosenberger, D. Spellman, and M. Stille, Test words, generic elements and almost primitivity, Pacific J. Math. 190 (1999), no. 2, 277–297. MR 1722895, DOI 10.2140/pjm.1999.190.277
- Abraham Karrass and Donald Solitar, On finitely generated subgroups of a free group, Proc. Amer. Math. Soc. 22 (1969), 209–213. MR 245655, DOI 10.1090/S0002-9939-1969-0245655-2
- Mutuo Takahasi, Note on locally free groups, J. Inst. Polytech. Osaka City Univ. Ser. A 1 (1950), 65–70. MR 41845
Additional Information
- Charles McCoy
- Affiliation: Deparment of Mathematics, University of Portland, Portland, Oregon 97203
- MR Author ID: 695683
- John Wallbaum
- Affiliation: Deparment of Mathematical Sciences, Eastern Mennonite University, Harrisonburg, Virginia 22802
- Received by editor(s): August 25, 2010
- Published electronically: June 21, 2012
- © Copyright 2012
American Mathematical Society
The copyright for this article reverts to public domain 28 years after publication. - Journal: Trans. Amer. Math. Soc. 364 (2012), 5729-5734
- MSC (2010): Primary 03C57
- DOI: https://doi.org/10.1090/S0002-9947-2012-05458-4
- MathSciNet review: 2946929