Related papers: Pincherle's theorem in Reverse Mathematics and com…
In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can be continuously or computably transferred into each other? For this…
Dag Normann and the author have recently initiated the study of the logical and computational properties of the uncountability of $\mathbb{R}$ formalised as the statement $\textsf{NIN}$ (resp. $\textsf{NBI}$ that there is no injection…
We discuss some well-known compactness principles for uncountable structures of small regular sizes ($\omega_n$ for $2 \le n<\omega$, $\aleph_{\omega+1}$, $\aleph_{\omega^2+1}$, etc.), consistent from weakly compact (the size-restricted…
We prove that Picard-Lindel\"of iterations for an arbitrary smooth normal Cauchy problem for PDE converge if we assume a suitable Weissinger-like sufficient condition. This condition includes both a large class of non-analytic PDE or…
Nets are generalisations of sequences involving possibly uncountable index sets; this notion was introduced about a century ago by Moore and Smith. They also established the generalisation to nets of various basic theorems of analysis due…
In his first set theory paper (1874), Cantor establishes the uncountability of $\mathbb{R}$. We study the latter in Kohlenbach's higher-order Reverse Mathematics, motivated by the observation that one cannot study concepts like `arbitrary…
The uncountability of the real numbers is one of their most basic properties, known (far) outside of mathematics. Cantor's 1874 proof of the uncountability of the real numbers even appears in the very first paper on set theory, i.e. a…
Restricting the chain-antichain principle CAC to partially ordered sets which respect the natural ordering of the integers is a trivial distinction in the sense of classical reverse mathematics. We utilize computability-theoretic reductions…
We extend the relative index theorem on non-compact manifolds to encompass a wide variety of hypoelliptic differential operators of arbitrary order, demonstrating that the change in index when changing a differential operator locally can be…
An inverse problem of finding an obstacle and the boundary condition on its surface from the fixed-energy scattering data is studied. A new method is developed for a proof of the uniqueness results. The method does not use the discreteness…
A recognized trend of research investigates generalizations of the Hadamard's inversion theorem to functions that may fail to be differentiable. In this vein, the present paper explores some consequences of a recent result about the…
We demonstrate that the Weihrauch lattice can be used to classify the uniform computational content of computability-theoretic properties as well as the computational content of theorems in one common setting. The properties that we study…
Since the Hadamard Theorem, several metric and topological conditions have emerged in the literature to date, yielding global inversion and implicit theorems for functions in different settings. Relevant examples are the mappings between…
This paper continues to study the connection between reverse mathematics and Weihrauch reducibility. In particular, we study the problems formed from Maltsev's theorem on the order types of countable ordered groups. Solomon showed that the…
Recursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], and D. Lacombe [1955]. It is based on a discrete mechanical framework that can be used to model computation over the real numbers. In this context the…
Let $ f: \mathbb{R} ^ n \rightarrow \mathbb{R}^n $ be a Lipschitz mapping with generalized Jacobian at $x_0$, denoted by $\partial f(x_0)$, is of maximal rank. F. H. Clarke (1976) proved that $f$ is locally invertible. In this paper, we…
This paper defines a new notion of bounded computable randomness for certain classes of sub-computable functions which lack a universal machine. In particular, we define such versions of randomness for primitive recursive functions and for…
Although the categorical arithmetic is not effectively axiomatizable, the belief that the incompleteness Theorems can be apply to it is fairly common. Furthermore, the so-called "essential" (or "inherent") semantic incompleteness of the…
The 1987 Bourgain-Tzafriri Restricted Invertibility Theorem is one of the most celebrated theorems in analysis. At the time of their work, the authors raised the question of a possible infinite dimensional version of the theorem. In this…
A. V. Arhangel'ski\u{i} introduced in 2012, when he was visiting the department of Mathematics at King Abduaziz University, new weaker versions of normality, called \it $C$-normality, \rm and \it countable normality. \rm The purpose of this…