Very weak fragments of weak K\H{o}nig's lemma
Logic
2021-01-05 v1
Abstract
It is well-known that any finite -class of 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\H{o}nig's lemma to answer this qeustion.
Cite
@article{arxiv.2101.00636,
title = {Very weak fragments of weak K\H{o}nig's lemma},
author = {Stephen G. Simpson and Keita Yokoyama},
journal= {arXiv preprint arXiv:2101.00636},
year = {2021}
}
Comments
Technical note