An induction principle over real numbers

Archive for Mathematical Logic 56 (1-2):43-49 (2017)
  Copy   BIBTEX

Abstract

We give a constructive proof of the open induction principle on real numbers, using bar induction and enumerative open sets. We comment the algorithmic content of this result.

Categories

Keywords

Reprint years

DOI

10.1007/s00153-016-0513-8

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,809

External links

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

Through your library

My notes

Similar books and articles

A note on Bar Induction in Constructive Set Theory.Michael Rathjen - 2006 - Mathematical Logic Quarterly 52 (3):253-258.
An induction principle and pigeonhole principles for k-finite sets.Andreas Blass - 1995 - Journal of Symbolic Logic 60 (4):1186-1193.
Why Topology in the Minimalist Foundation Must be Pointfree.Maria Emilia Maietti & Giovanni Sambin - 2013 - Logic and Logical Philosophy 22 (2):167-199.
WEIHRAUCH, K. and KREITZ, C., Representations of the real numbers and of the open subsets of the set of real numbers WILKIE, AJ and PARIS, JB, On the scheme of induction for bounded arithmetic formulas. [REVIEW]Las Kirby & R. Diaconescu - 1987 - Annals of Pure and Applied Logic 35:303.
Hindman’s theorem for sums along the full binary tree, $$\Sigma ^0_2$$ Σ 2 0 -induction and the Pigeonhole principle for trees. [REVIEW]Lorenzo Carlucci & Daniele Tavernelli - 2022 - Archive for Mathematical Logic 61 (5):827-839.
Dialectica interpretation of well-founded induction.Helmut Schwichtenberg - 2008 - Mathematical Logic Quarterly 54 (3):229-239.
A Note On The Axiomatisation Of Real Numbers.Thierry Coquand & L. Henri Lombardi - 2008 - Mathematical Logic Quarterly 54 (3):224-228.
Is the intuitionistic bar-induction a constructive principle?Klaus Mainzer - 1977 - Notre Dame Journal of Formal Logic 18 (4):583-588.
Bar induction and ω model reflection.Gerhard Jäger & Thomas Strahm - 1999 - Annals of Pure and Applied Logic 97 (1-3):221-230.
On Σ‐definability without equality over the real numbers.Andrei S. Morozov & Margarita V. Korovina - 2008 - Mathematical Logic Quarterly 54 (5):535-544.

Analytics

Added to PP
2014-03-09

Downloads
26 (#849,392)

6 months
6 (#851,951)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

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.

Add more references