2000 character limit reached
On the Rainbow Ramsey theorem and the Canonical Ramsey Theorem for pairs without AC
Published 4 Jan 2024 in math.LO and math.CO | (2401.02215v2)
Abstract: In set theory without the Axiom of Choice, we study the set-theoretic strength of a generalized version of the Rainbow Ramsey theorem and the Canonical Ramsey Theorem for pairs introduced by Erd\H{o}s and Rado, concerning their interrelation with several weak choice forms.
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.