An uncountable version of Pták's combinatorial lemma

preprint2020arXivOpen access

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ω_1 can not be decided in ZFC alone. We also provide a sufficient condition, for a class of larger cardinals.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.