Abstract

In the context of constructive reverse mathematics, we characterize the difference between König’s lemma and weak König’s lemma by a particular fragment of the countable choice principle. Specifically, we show that König’s lemma can be decomposed into weak König’s lemma and the choice principle over a weak intuitionistic two-sorted arithmetic.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call