Very weak fragments of weak Kőnig's lemma
Stephen G. Simpson, Keita Yokoyama · arXiv (Cornell University) · 2021
It is well-known that any finite $Π^{0}_{1}$-class of $2^{\mathbb N}$ has a computable member. Then, how can we understand this in the context of reverse mathematics? In this note, we consider several very weak fragments of Kőnig's lemma to answer this qeustion.