Related papers: Proof mining in $L^p$ spaces
We extend the theoretical framework of proof mining by establishing general logical metatheorems that allow for the extraction of the computational content of theorems with prima facie "non-computational" proofs from probability theory,…
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 an algebraic view on logic programming, related to proof theory and more specifically linear logic and geometry of interaction. Within this construction, a characterization of logspace (deterministic and non-deterministic)…
We use techniques of proof mining to extract a uniform rate of metastability (in the sense of Tao) for the strong convergence of approximants to fixed points of uniformly continuous pseudocontractive mappings in Banach spaces which are…
We show that every metric space with bounded geometry uniformly embeds into an explicit reflexive Banach space (a direct sum of l^p spaces). In the case of discrete groups we show the analogue of a-T-menability. That is, we construct a…
We provide a framework for proofs of structural theorems about sets with positive Banach logarithmic density. For example, we prove that if $A\subseteq \mathbb{N}$ has positive Banach logarithmic density, then $A$ contains an approximate…
We present a comprehensive programme analysing the decomposition of proof systems for non-classical logics into proof systems for other logics, especially classical logic, using an algebra of constraints. That is, one recovers a proof…
We adapt a continuous logic axiomatization of tracial von Neumann algebras due to Farah, Hart and Sherman in order to prove a metatheorem for this class of structures in the style of proof mining, a research program that aims to obtain the…
We further develop the theoretical framework of proof mining, a program in mathematical logic that seeks to quantify and extract computational information from prima facie `non-computational' proofs from the mainstream mathematical…
Understanding the complemented subspaces of $L_p$ has been an interesting topic of research in Banach space theory since 1960. 1999, Alspach proposed a systematic approach to classifying the subspaces of $L_p$ by introducing a norm given by…
We give a sufficient criterion for complex analyticity of nonlinear maps defined on direct limits of normed spaces. This tool is then used to construct new classes of (real and complex) infinite dimensional Lie groups: (a) groups of germs…
New concepts related to approximating a Lipschitz function between Banach spaces by affine functions are introduced. Results which clarify when such approximations are possible are proved and in some cases a complete characterization of the…
The new class of Banach spaces, so-called asymptotic $l_p$ spaces, is introduced and it is shown that every Banach space with bounded distortions contains a subspace from this class. The proof is based on an investigation of certain…
In this paper we relate the geometry of Banach spaces to the theory of differential equations, apparently in a new way. We will construct Banach function space norms arising as weak solutions to ordinary differential equations of first…
Accretive and monotone operator theory are central branches of nonlinear functional analysis and constitute the abstract study of set-valued mappings between function spaces. This paper deals with the computational properties of certain…
The use of logical systems for problem-solving may be as diverse as in proving theorems in mathematics or in figuring out how to meet up with a friend. In either case, the problem solving activity is captured by the search for an…
The notions of $p$-convexity and concavity are fundamental tools for studying Banach lattices, as they partition the class of Banach lattices into a scale of spaces with $L_p$-like properties. Upper and lower $p$-estimates provide a…
Several formal systems, such as resolution and minimal model semantics, provide a framework for logic programming. In this paper, we will survey the use of structural proof theory as an alternative foundation. Researchers have been using…
We show that there exists a strong uniform embedding from any proper metric space into any Banach space without cotype. Then we prove a result concerning the Lipschitz embedding of locally finite subsets of $\mathcal{L}_{p}$-spaces. We use…
We study Banach spaces X with a strongly asymptotic l_p basis (any disjointly supported finite set of vectors far enough out with respect to the basis behaves like l_p) which are minimal (X embeds into every infinite dimensional subspace).…