Results 11  20
of
36
Effective Choice and Boundedness Principles in Computable Analysis
, 2009
"... In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can be continuously or computably transferred into each other? For this purpose theorems are considered via their realizers which a ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can be continuously or computably transferred into each other? For this purpose theorems are considered via their realizers which are operations with certain input and output data. The technical tool to express continuous or computable relations between such operations is Weihrauch reducibility and the partially ordered degree structure induced by it. We have identified certain choice principles on closed sets which are cornerstones among Weihrauch degrees and it turns out that certain core theorems in analysis can be classified naturally in this structure. In particular, we study theorems such as the Intermediate Value Theorem, the Baire Category Theorem, the Banach Inverse Mapping Theorem, the Closed Graph Theorem and the Uniform Boundedness Theorem. Wellknown omniscience principles from constructive mathematics such as LPO and LLPO can also naturally be considered as Weihrauch degrees and they play an important role in our classification. Our classification scheme does not require any particular logical framework or axiomatic setting, but it can be carried out in the framework of classical mathematics using tools of topology, computability theory and computable analysis. Finally, we present a number of metatheorems that allow to derive upper bounds for the classification of the Weihrauch degree of many theorems and we discuss the Brouwer Fixed Point Theorem as an example.
Cauchy nets in the constructive theory of apartness spaces
 Scientiae Mathematicae Japonicae
, 2002
"... Abstract. A notion of Cauchy net is introduced into the constructive theory of apartness spaces. It is shown that for a sequence in a metric space this notion is equivalent to the standard metric notion of Cauchy sequence. Applications of this notion are then given, culminating in a generalisation o ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. A notion of Cauchy net is introduced into the constructive theory of apartness spaces. It is shown that for a sequence in a metric space this notion is equivalent to the standard metric notion of Cauchy sequence. Applications of this notion are then given, culminating in a generalisation of Bishop’s Lemma on locatedness. 1 Introduction Axioms for a constructive theory of apartness between sets were introduced in [12], where the particular example of a uniform space was discussed in detail. In the present paper we discuss Cauchy and convergent sequences in the framework of that theory. By constructive mathematics we mean mathematics developed with intuitionistic logic
Constructive Order Completeness
, 2004
"... Partially ordered sets are investigated from the point of view of Bishop’s constructive mathematics. Unlike the classical case, one cannot prove constructively that every nonempty bounded above set of real numbers has a supremum. However, the order completeness of R is expressed constructively by an ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Partially ordered sets are investigated from the point of view of Bishop’s constructive mathematics. Unlike the classical case, one cannot prove constructively that every nonempty bounded above set of real numbers has a supremum. However, the order completeness of R is expressed constructively by an equivalent condition for the existence of the supremum, a condition of (upper) order locatedness which is vacuously true in the classical case. A generalization of this condition will provide a definition of upper locatedness for a partially ordered set. It turns out that the supremum of a set S exists if and only if S is upper located and has a weak supremum—that is, the classical least upper bound. A partially ordered set will be called order complete if each nonempty subset that is bounded above and upper located has a supremum. It can be proved that, as in the classical mathematics, R n is order complete. 1
A Constructive Theory of PointSet Nearness
 in Proceedings of Topology in Computer Science: Constructivity; Asymmetry and Partiality; Digitization, Seminar in Dagstuhl, Germany, 4–9 June 2000; Springer Lecture Notes in Computer Science
, 2001
"... An axiomatic constructive development of the theory of nearness and apartness of a point and a set is introduced as a setting for topology. ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
An axiomatic constructive development of the theory of nearness and apartness of a point and a set is introduced as a setting for topology.
Deciding LinearTranscendental Problems
, 2000
"... We present a decision procedure for lineartranscendental problems formalized in a suitable firstorder language. The problems are formalized by formulas with arbitrary quantified linear variables and a block of quantifiers with respect to mixed lineartranscendental variables. Variables may range b ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We present a decision procedure for lineartranscendental problems formalized in a suitable firstorder language. The problems are formalized by formulas with arbitrary quantified linear variables and a block of quantifiers with respect to mixed lineartranscendental variables. Variables may range both over the reals and over the integers. The transcendental functions admitted are characterized axiomatically; they include the exponential function applied to a polynomial, hyperbolic functions and their inverses, and the arcustangent. The decision procedure is explicit and implementable; it is based on mixed realinteger linear elimination, the symbolic test point method, elementary analysis, and Lindemann's theorem. As a byproduct we obtain sample solutions for existential formulas and a qualitative description of the connected components of the satisfaction set wrt. a mixed lineartranscendental variable.
PLURALISM IN MATHEMATICS
, 2004
"... We defend pluralism in mathematics, and in particular Errett Bishop’s constructive approach to mathematics, on pragmatic grounds, avoiding the philosophical issues which have dissuaded many mathematicians from taking it seriously. We also explain the computational value of interval arithmetic. ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We defend pluralism in mathematics, and in particular Errett Bishop’s constructive approach to mathematics, on pragmatic grounds, avoiding the philosophical issues which have dissuaded many mathematicians from taking it seriously. We also explain the computational value of interval arithmetic.
Vitali’s theorem and WWKL
 Archive for Mathematical Logic
"... Abstract. Continuing the investigations of X. Yu and others, we study the role of set existence axioms in classical Lebesgue measure theory. We show that pairwise disjoint countable additivity for open sets of reals is provable in RCA0. We show that several wellknown measuretheoretic propositions ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. Continuing the investigations of X. Yu and others, we study the role of set existence axioms in classical Lebesgue measure theory. We show that pairwise disjoint countable additivity for open sets of reals is provable in RCA0. We show that several wellknown measuretheoretic propositions including the Vitali Covering Theorem are equivalent to WWKL over RCA0. 1.
Adjoints, absolute values and polar decompositions
 Journal of Operator Theory
"... Abstract. Various questions about adjoints, absolute values and polar decompositions of operators are addressed from a constructive point of view. The focus is on bilinear forms. Conditions are given for the existence of an adjoint, and a general notion of a polar decomposition is developed. The Rie ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. Various questions about adjoints, absolute values and polar decompositions of operators are addressed from a constructive point of view. The focus is on bilinear forms. Conditions are given for the existence of an adjoint, and a general notion of a polar decomposition is developed. The Riesz representation theorem is proved without countable choice.
Sets, Complements and Boundaries
"... The relations among a set, its complement, and its boundary are examined constructively. A crucial tool is a theorem that allows the construction of a point where a segment comes close to the boundary of a set in a Banach space. Brouwerian examples show that many of the results are the best possible ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The relations among a set, its complement, and its boundary are examined constructively. A crucial tool is a theorem that allows the construction of a point where a segment comes close to the boundary of a set in a Banach space. Brouwerian examples show that many of the results are the best possible.
Constructive Aspects of the Dirichlet Problem 1
"... Abstract: We examine, within the framework of Bishop's constructive mathematics, various classical methods for proving the existence of weak solutions of the Dirichlet Problem, with a view to showing why those methods do not immediately translate into viable constructive ones. In particular, we disc ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract: We examine, within the framework of Bishop's constructive mathematics, various classical methods for proving the existence of weak solutions of the Dirichlet Problem, with a view to showing why those methods do not immediately translate into viable constructive ones. In particular, we discuss the equivalence of the existence of weak solutions of the Dirichlet Problem and the existence of minimizers for certain associated integral functionals. Our analysis pinpoints exactly what is needed to nd weak solutions of the Dirichlet Problem: namely, the computation of either the norm of a linear functional on a certain Hilbert space or, equivalently, the in mum of an associated integral functional.