2000 character limit reached
Definability of maximal cofinitary groups
Published 10 Dec 2022 in math.GR and math.LO | (2212.05318v1)
Abstract: We present a proof of a result, previously announced by the second author, that there is a closed (even $\Pi0_1$) set generating an $F_\sigma$ (even $\Sigma0_2$) maximal cofinitary group (short, mcg) which is isomorphic to a free group. In this isomorphism class, this is the lowest possible definitional complexity of an mcg.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.