Where Pigeonhole Principles meet König Lemmas
arXiv:1912.03487
Abstract
We study the pigeonhole principle for -definable injections with domain twice as large as the codomain, and the weak König lemma for -definable trees in which every level has at least half of the possible nodes. We show that the latter implies the existence of -random reals, and is conservative over the former. We also show that the former is strictly weaker than the usual pigeonhole principle for -definable injections.
33 pages