2000 character limit reached
PFA(S)[S] and the Arhangel'skii-Tall problem (1104.2795v1)
Published 14 Apr 2011 in math.GN and math.LO
Abstract: We discuss the Arhangel'skii-Tall problem and related questions in models obtained by forcing with a coherent Souslin tree.
Collections
Sign up for free to add this paper to one or more collections.