2000 character limit reached
Compactness in singular cardinals revisited
Published 14 Jan 2014 in math.LO | (1401.3175v2)
Abstract: This is the second combinatorial proof of the compactness theorem for singular from 1977. In fact it gives a somewhat stronger theorem.
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.