An application of proof mining to nonlinear iterations

Annals of Pure and Applied Logic 165 (9):1484-1500 (2014)
  Copy   BIBTEX

Abstract

In this paper we apply methods of proof mining to obtain a highly uniform effective rate of asymptotic regularity for the Ishikawa iteration associated with nonexpansive self-mappings of convex subsets of a class of uniformly convex geodesic spaces. Moreover, we show that these results are guaranteed by a combination of logical metatheorems for classical and semi-intuitionistic systems

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,174

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

Proof mining in lp spaces.Andrei Sipoş - 2019 - Journal of Symbolic Logic 84 (4):1612-1629.
A lower bound for intuitionistic logic.Pavel Hrubeš - 2007 - Annals of Pure and Applied Logic 146 (1):72-90.
Strongly uniform bounds from semi-constructive proofs.Philipp Gerhardy & Ulrich Kohlenbach - 2006 - Annals of Pure and Applied Logic 141 (1):89-107.
Gödel functional interpretation and weak compactness.Ulrich Kohlenbach - 2012 - Annals of Pure and Applied Logic 163 (11):1560-1579.
Intuitionistic completeness of first-order logic.Robert Constable & Mark Bickford - 2014 - Annals of Pure and Applied Logic 165 (1):164-198.
Proof mining in L1-approximation.Ulrich Kohlenbach & Paulo Oliva - 2003 - Annals of Pure and Applied Logic 121 (1):1-38.
On lengths of proofs in non-classical logics.Pavel Hrubeš - 2009 - Annals of Pure and Applied Logic 157 (2-3):194-205.

Analytics

Added to PP
2015-01-22

Downloads
17 (#1,153,842)

6 months
7 (#715,360)

Historical graph of downloads
How can I increase my downloads?