The binary expansion and the intermediate value theorem in constructive reverse mathematics

Archive for Mathematical Logic 58 (1-2):203-217 (2019)
  Copy   BIBTEX

Abstract

We introduce the notion of a convex tree. We show that the binary expansion for real numbers in the unit interval ) is equivalent to weak König lemma ) for trees having at most two nodes at each level, and we prove that the intermediate value theorem is equivalent to \ for convex trees, in the framework of constructive reverse mathematics.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 104,026

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2018-05-11

Downloads
49 (#487,801)

6 months
5 (#828,124)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Constructivism in Mathematics: An Introduction.A. S. Troelstra & Dirk Van Dalen - 1988 - Amsterdam: North Holland. Edited by D. van Dalen.
Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1999 - Studia Logica 77 (1):129-129.
Constructive Analysis.Errett Bishop & Douglas Bridges - 1987 - Journal of Symbolic Logic 52 (4):1047-1048.
Foundations of Constructive Analysis.Errett Bishop - 1967 - New York, NY, USA: Mcgraw-Hill.

View all 13 references / Add more references