Mathematics – Logic
Scientific paper
2008-01-11
Electronic Notes in Theoretical Computer Science, Vol. 165 (2006), 95-106
Mathematics
Logic
in G. Mints and R. de Queiroz (Eds.): Proceedings of the 13th Workshop on Logic, Language, Information and Computation (WoLLIC
Scientific paper
This paper is part of the general project of proof mining, developed by Kohlenbach. By "proof mining" we mean the logical analysis of mathematical proofs with the aim of extracting new numerically relevant information hidden in the proofs. We present logical metatheorems for classes of spaces from functional analysis and hyperbolic geometry, like Gromov hyperbolic spaces, ${\mathbb R}$-trees and uniformly convex hyperbolic spaces. Our theorems are adaptations to these structures of previous metatheorems of Gerhardy and Kohlenbach, and they guarantee a-priori, under very general logical conditions, the existence of uniform bounds. We give also an application in nonlinear functional analysis, more specifically in metric fixed-point theory. Thus, we show that the uniform bound on the rate of asymptotic regularity for the Krasnoselski-Mann iterations of nonexpansive mappings in uniformly convex hyperbolic spaces obtained in a previous paper is an instance of one of our metatheorems.
No associations
LandOfFree
Proof mining in ${\mathbb R}$-trees and hyperbolic spaces does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Proof mining in ${\mathbb R}$-trees and hyperbolic spaces, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Proof mining in ${\mathbb R}$-trees and hyperbolic spaces will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-547627