Very weak fragments of weak Kőnig's lemma

Abstract

It is well-known that any finite ${\Pi }_1^0$-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.

Technical note