Very weak fragments of weak Kőnig's lemma

2021/01/03 by Stephen G. Simpson, Simpson, Stephen G., Keita Yokoyama +1 · 1 citation
Computer Science · Mathematics · #Computability, Logic, AI Algorithms #Benford’s Law and Fraud Detection #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.2101.00636

Abstract

It is well-known that any finite Π⁰₁-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.

Cited by

• The reverse mathematics of bounded Ramsey's theorem for pairs

Related

• An isomorphism theorem for models of Weak König's Lemma without primitive recursion
• Weak König's lemma implies the uniform continuity theorem: a direct proof
• More conservativity for weak Kőnig's lemma
• On the Π¹₂ consequences of Π¹₁-CA₀
• Reverse Mathematics of the uncountability of ℝ