2000 character limit reached
Cofinitary groups and projective well-orders
Published 27 Dec 2023 in math.LO | (2312.16618v2)
Abstract: We introduce the notion of a tight cofinitary group, which captures forcing indestructibility of maximal cofinitary groups for a long list of partial orders, including Cohen, Sacks, Miller, Miller partition forcing and Shelah's poset for diagonalizing maximal ideal. Introducing a new robust coding technique, we establish the relative consistency of $\mathfrak{a}_g=\mathfrak{d}<\mathfrak{c}=\aleph_2$ alongside the existence of a $\Delta1_3$-wellorder of the reals and a co-analytic witness for $\mathfrak{a}_g$.
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.