Abstract not found

Abstract not found

In [12], the second author obtained metatheorems for the extraction of effective (uniform) bounds from classical, prima facie nonconstructive proofs in functional analysis. These metatheorems for the first time cover general classes of structures like arbitrary metric, hyperbolic, CAT(0) and normed linear spaces and guarantee the independence of the bounds from parameters raging over metrically bounded (not necessarily compact!) spaces. The use of classical logic imposes some severe restrictions on the formulas and proofs for which the extraction can be carried out. In this paper we consider similar metatheorems for semi-intuitionistic proofs, i.e. proofs in an intuitionistic setting enriched with certain non-constructive principles. Contrary to

Abstract not found

In this paper we obtain a quadratic bound on the rate of asymptotic regularity for the Krasnoselski-Mann iterations of nonexpansive mappings in CAT(0)-spaces, whereas previous results guarantee only exponential bounds. The method we use is to extend to the more general setting of uniformly convex hyperbolic spaces a quantitative version of a strengthening of Groetsch’s theorem obtained by Kohlenbach using methods from mathematical logic (so-called “proof mining”). Keywords: MSC: Proof mining, metric fixed point theory, nonexpansive functions,

We propose the class of uniformly convex W-hyperbolic spaces with monotone modulus of uniform convexity (UCW-hyperbolic spaces for short) as an appropriate setting for the study of nonexpansive iterations. UCW-hyperbolic spaces are a natural generalization both of uniformly convex normed spaces and CAT(0)-spaces. Furthermore, we apply proof mining techniques to get effective rates of asymptotic regularity for Ishikawa iterations of nonexpansive self-mappings of closed convex subsets in UCW-hyperbolic spaces. These effective results are new even for uniformly convex Banach spaces. 1

In this paper we obtain new effective results on the Halpern iterations of nonexpansive mappings using methods from mathematical logic or, more specifically, proof-theoretic techniques. We give effective rates of asymptotic regularity for the Halpern iterations of nonexpansive selfmappings of nonempty convex sets in normed spaces. The paper presents another case study in the project of proof mining, which is concerned with the extraction of effective uniform bounds from (prima-facie) ineffective proofs. 1

mappings, rates of convergence and applications