Abstract
We introduce the notion of a convex tree. We show that the binary expansion for real numbers in the unit interval (BE) is equivalent to weak Konig lemma (WKL) for trees having at most two nodes at each level, and we prove that the intermediate value theorem is equivalent to WKL for convex trees, in the framework of constructive reverse mathematics.
Item Type: | Journal article |
---|---|
Faculties: | Mathematics, Computer Science and Statistics > Mathematics |
Subjects: | 500 Science > 510 Mathematics |
ISSN: | 0933-5846 |
Language: | English |
Item ID: | 82395 |
Date Deposited: | 15. Dec 2021, 15:01 |
Last Modified: | 13. Aug 2024, 12:43 |