scientific article
From MaRDI portal
Publication:3837732
zbMath0881.03032MaRDI QIDQ3837732
Publication date: 27 January 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Constructive and recursive analysis (03F60) Interpolation in approximation theory (41A05) Constructive real analysis (26E40)
Related Items (28)
Proof mining in \(L_{1}\)-approximation ⋮ Asymptotically nonexpansive mappings in uniformly convex hyperbolic spaces ⋮ Light monotone Dialectica methods for proof mining ⋮ Effective results on a fixed point algorithm for families of nonlinear mappings ⋮ Some logical metatheorems with applications in functional analysis ⋮ A parametrised functional interpretation of Heyting arithmetic ⋮ Hardwiring truth in functional interpretations ⋮ Bounds on strong unicity for Chebyshev approximation with bounded coefficients ⋮ A proof‐theoretic metatheorem for tracial von Neumann algebras ⋮ On quantitative versions of theorems due to F. E. Browder and R. Wittmann ⋮ A quantitative nonlinear strong ergodic theorem for Hilbert spaces ⋮ A finitization of Littlewood's Tauberian theorem and an application in Tauberian remainder theory ⋮ Logical metatheorems for abstract spaces axiomatized in positive bounded logic ⋮ The bounded functional interpretation of bar induction ⋮ Proof mining and effective bounds in differential polynomial rings ⋮ Gödel functional interpretation and weak compactness ⋮ An application of proof mining to nonlinear iterations ⋮ The abstract type of the real numbers ⋮ A Logical Uniform Boundedness Principle for Abstract Metric and Hyperbolic Spaces ⋮ Bounded functional interpretation ⋮ A complexity analysis of functional interpretations ⋮ Refined program extraction from classical proofs ⋮ Injecting uniformities into Peano arithmetic ⋮ Metastability of the proximal point algorithm with multi-parameters ⋮ Unnamed Item ⋮ On the removal of weak compactness arguments in proof mining ⋮ On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness ⋮ Light Dialectica Program Extraction from a Classical Fibonacci Proof
This page was built for publication:
