2000 character limit reached
Definable maximal cofinitary groups
Published 9 Mar 2016 in math.LO | (1603.02942v1)
Abstract: Using countable support iteration of $S$-proper posets, for some appropriate stationary set $S$, we obtain a generic extension of the constructible universe, in which $\mathfrak{b}=\mathfrak{c}=\aleph_2$ and there is a maximal cofinitary group with a $\Pi1_2$-definable set of generators.
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.