On Csn() and the Juhasz-Kunen question
Abstract
We generalize the combinatorial principles Cn(), Csn() and Princ() introduced by various authors, and prove some of their properties and connections between them. We also answer a question asked by Juhasz-Kunen about the relation between these principles, by showing that Cn() does not imply Cn+1(), for any n>2. We also show the consistency of C()+ Cs().
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.