An uncountable version of Pt\'ak's combinatorial lemma
Abstract
In this note we are concerned with the validity of an uncountable analogue of a combinatorial lemma due to Vlastimil Pt\'ak. We show that the validity of the result for ω1 can not be decided in ZFC alone. We also provide a sufficient condition, for a class of larger cardinals.
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.