Related papers: Pincherle's theorem in Reverse Mathematics and com…
We focus on three different convexity principles for local and nonlocal variational integrals. We prove various generalizations of them, as well as their equivalences. Some applications to nonlinear eigenvalue problems and Hardy-type…
Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…
In this thesis, we investigate the computational content and the logical strength of Ramsey's theorem and its consequences. For this, we use the frameworks of reverse mathematics and of computable reducibility. We proceed to a systematic…
We study closedness of the range, adjointability and generalized invertibility of modular operators between Hilbert modules over locally C*-algebras of coefficients. Our investigations and the recent results of M. Frank [Characterizing…
One of the elegant achievements in the history of proof theory is the characterization of the provably total recursive functions of an arithmetical theory by its proof-theoretic ordinal as a way to measure the time complexity of the…
While inverse estimates in the context of radial basis function approximation on boundary-free domains have been known for at least ten years, such theorems for the more important and difficult setting of bounded domains have been notably…
We work in set-theory without choice ZF. Denoting by AC(N) the countable axiom of choice, we show in ZF+AC(N) that the closed unit ball of a uniformly convex Banach space is compact in the convex topology (an alternative to the weak…
Limitation of computational resources is considered as a universal principle that for simulation is as fundamental as physical laws are. It claims that all experimentally verifiable implications of physical laws can be simulated by the…
We present some extensions of classical results that involve elements of the dual of Banach spaces, such as Bishop-Phelp's theorem and James' compactness theorem, but restricting to sets of functionals determined by geometrical properties.…
Positive definite kernels and their associated Reproducing Kernel Hilbert Spaces provide a mathematically compelling and practically competitive framework for learning from data. In this paper we take the approximation theory point of view…
Recently, versions of neural networks with infinite-dimensional affine operators inside the computational units (``neural operator'' networks) have been applied to learn solutions to differential equations. To enable practical computations,…
It is difficult to extract reliable criteria for causal locality from the limited ingredients found in textbook quantum theory. In the end, Bell humbly warned that his eponymous theorem was based on criteria that "should be viewed with the…
Are minds subject to laws of physics? Are the laws of physics computable? Are conscious thought processes computable? Currently there is little agreement as to what are the right answers to these questions. Penrose goes one step further and…
Reversible algorithms play a crucial role both in classical and quantum computation. While for a classical bit the only nontrivial reversible operation is the bit-flip, nature is far more versatile in what it allows to do to a quantum bit.…
In 2004 Podelski and Rybalchenko expressed the termination of transition-based programs as a property of well-founded relations. The classical proof by Podelski and Rybalchenko requires Ramsey's Theorem for pairs which is a purely classical…
We prove a compact embedding theorem in a class of spaces of piecewise H1 functions subordinated to a class of shape regular, but not necessarily quasi-uniform triangulations of a polygonal domain. This result generalizes the…
We prove that the existence of finite combinatorial objects such as affine planes, mutually orthogonal Latin squares, and resolvable balanced incomplete block designs can be reformulated as the existence of certain algorithmic reductions…
Let $G$ be a locally compact group and $1\leq p<\infty$. Based on some important earlier works, in this paper the concept of $L_p^T-$function is introduced. Then the structure of the space $L^{T}_p(G)$, which is consisting of all…
A connection is revealed between the superposition principle and locality. A self consistent interpretation of the superposition principle is put forth, from which it is shown that quantum mechanics may be a local statistical theory. Then…
Reflection principles (or dually speaking, compactness principles) often give rise to combinatorial guessing principles. Uniformization properties, on the other hand, are examples of anti-guessing principles. We discuss the tension and the…