arXiv · 1805.06028
An uncountable version of Pták'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ák. 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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Petr Hájek, Tommaso Russo. 2020-06-08. An uncountable version of Pták'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.