2000 character limit reached
Between Whitehead groups and uniformization
Published 23 Mar 2022 in math.LO and math.GR | (2203.12585v2)
Abstract: For a given stationary set of countable ordinals we prove (in ) that the assertion "every -ladder system has -uniformization" is equivalent to "every strongly -free abelian group of cardinality with non-freeness invariant is -coseparable, i.e. Ext (in particular Whitehead, i.e.\ Ext)". This solves problems B3 and B4 from Eklof and Mekler's monograph.
Paper Prompts
Sign up for free to create and run prompts on this paper.