Elementary Choiceless Constructive Analysis

Peter M. Schuster

To appear at Computer Science Logic 2000 (CSL 2000), Fischbachau near Munich, Germany, 21-26 August 2000


Abstract

Existential statements seem to admit a constructive proof without countable choice only if the object to be constructed is uniquely determined, or is intended as an approximate solution of the problem in question. This conjecture is substantiated by examining some basic tools of mathematical analysis from a choice-free constructive point of view, concentrating on Dedekind cuts as an appropriate notion of real numbers. As a complement, the question whether densely defined continuous functions do approximate intermediate values is reduced to connectivity properties of the corresponding domains.


Server START Conference Manager
Update Time 19 Apr 2000 at 10:13:07
Maintainer csl2000-org@tcs.informatik.uni-muenchen.de.
Start Conference Manager
Conference Systems