English
Related papers

Related papers: On the removal of weak compactness arguments in pr…

200 papers

Weakly dicomplemented lattices are bounded lattices equipped with two unary operations to encode a negation on {\it concepts}. They have been introduced to capture the equational theory of concept algebras \cite{Wi00}. They generalize…

Logic · Mathematics 2010-02-05 Leonard Kwuida , Hajime Machida

Consider the lattice of bounded linear operators on the space of Borel measures on a Polish space. We prove that the operators which are continuous with respect to the weak topology induced by the bounded measurable functions form a…

Functional Analysis · Mathematics 2015-11-05 Moritz Gerlach , Markus Kunze

We investigate infinitary wellfounded systems for linear logic with fixed points, with transfinite branching rules indexed by some closure ordinal $\alpha$ for fixed points. Our main result is that provability in the system for some…

Logic · Mathematics 2026-02-24 Anupam Das , Tikhon Pshenitsyn

In this paper, our main purpose is to establish a weak factorization of the classical Hardy spaces in terms of a multilinear Calder\'on-Zygmund operator on the ball Banach function spaces. Furthermore, a new characterization of the BMO…

Functional Analysis · Mathematics 2024-11-12 Yichun Zhao , Xiangxing Tao , Jiang Zhou

In a complete metric space that is equipped with a doubling measure and supports a Poincar\'e inequality, we study strict subsets, i.e. sets whose variational capacity with respect to a larger reference set is finite, in the case $p=1$.…

Metric Geometry · Mathematics 2019-03-12 Panu Lahti

Cut-elimination is the bedrock of proof theory with a multitude of applications from computational interpretations to proof analysis. It is also the starting point for important meta-theoretical investigations including decidability,…

Logic in Computer Science · Computer Science 2023-05-01 Agata Ciabattoni , Timo Lang , Revantha Ramanayake

Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…

Logic in Computer Science · Computer Science 2007-12-11 Klaus Aehlig , Arnold Beckmann

The present paper is devoted to a theory of profile decomposition for bounded sequences in \emph{homogeneous} Sobolev spaces, and it enables us to analyze the lack of compactness of bounded sequences. For every bounded sequence in…

Functional Analysis · Mathematics 2022-02-15 Mizuho Okumura

In this sequence, we first prove an abstract Morse index theorem in a Hilbert space modeling a variational problem with constraints. Then, our abstract formulation is applied to study several optimization setups including closed CMC…

Differential Geometry · Mathematics 2026-01-23 Hung Tran , Detang Zhou

In this paper, we illustrate the effectiveness of reproducing kernel Hilbert space techniques in the study of composition operators. For weighted Hardy spaces on the unit disk, we characterize the composition operators whose adjoint is…

Functional Analysis · Mathematics 2026-01-28 Preeti Kumari , P. Muthukumar , Antti Rasila

This article is a fundamental study in computable analysis. In the framework of Type-2 effectivity, TTE, we investigate computability aspects on finite and infinite products of effective topological spaces. For obtaining uniform results we…

Logic in Computer Science · Computer Science 2015-07-01 Robert Rettinger , Klaus Weihrauch

In order to make argumentation-based inference contestable, it is crucial to explain what changes can achieve a desired (instead of the contested) inference result. To this end, we introduce strength change explanations for quantitative…

Multiagent Systems · Computer Science 2026-03-03 Timotheus Kampik , Xiang Yin , Nico Potyka , Francesca Toni

It is well known that we can use structural proof theory to refine, or generalize, existing paradigmatic computational primitives, or to discover new ones. Under such a point of view we keep developing a programme whose goal is establishing…

Logic in Computer Science · Computer Science 2012-12-20 Luca Roversi

We show that properties of pairs of finite, positive and regular Borel measures on the complex unit circle such as domination, absolute continuity and singularity can be completely described in terms of containment and intersection of their…

Functional Analysis · Mathematics 2025-08-27 Jashan Bal , Robert T. W. Martin , Fouad Naderi

We study functions of least gradient as well as related superminimizers and solutions of obstacle problems in metric spaces that are equipped with a doubling measure and support a Poincar\'e inequality. We show a standard weak Harnack…

Metric Geometry · Mathematics 2018-01-29 Panu Lahti

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…

Functional Analysis · Mathematics 2020-01-17 Ulrich Kohlenbach , Andrei Sipos

This paper studies the probabilistic function approximation problem over reproducing kernel Hilbert spaces. We show the existence and uniqueness of the optimizer under mild assumptions. Furthermore, we generalize the celebrated representer…

Functional Analysis · Mathematics 2025-07-16 Dongwei Chen , Kai-Hsiang Wang

Composition operators with analytic symbols on some reproducing kernel Hilbert spaces of entire functions on a complex Hilbert space are studied. The questions of their boundedness, seminormality and positivity are investigated. It is…

Functional Analysis · Mathematics 2016-10-17 Jan Stochel , Jerzy B. Stochel

In this paper, we show that the approximation of high-dimensional functions, which are effectively low-dimensional, does not suffer from the curse of dimensionality. This is shown first in a general reproducing kernel Hilbert space set-up…

Numerical Analysis · Mathematics 2024-11-28 Christian Rieger , Holger Wendland

Much like admissibility is the key concept underlying preferred semantics, strong admissibility is the key concept underlying grounded semantics, as membership of a strongly admissible set is sufficient to show membership of the grounded…

Artificial Intelligence · Computer Science 2022-04-08 Martin Caminada , Sri Harikrishnan
‹ Prev 1 4 5 6 7 8 10 Next ›