arXiv · 1805.06028
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 $\omega_1$ can not be decided in ZFC alone. We also provide a sufficient condition, for a class of larger cardinals.
Explore related subjects
Keep this discovery
Petr Hájek, Tommaso Russo. 2018-05-15. An uncountable version of Pt\'ak's combinatorial lemma. https://doi.org/10.1016/j.jmaa.2018.10.049
Cite the original work for its findings. Save a collection to share your selection of sources.