An uncountable version of Pták's combinatorial lemma
arXiv:1805.06028 · doi:10.1016/j.jmaa.2018.10.049
Abstract
In this note we are concerned with the validity of an uncountable analogue of a combinatorial lemma due to Vlastimil Pták. We show that the validity of the result for can not be decided in ZFC alone. We also provide a sufficient condition, for a class of larger cardinals.
13 pp