Related papers: Pincherle's theorem in Reverse Mathematics and com…
The study is motivated by the known fact that, in the noncompact case, the main minimum-problem of the theory of interior capacities of condensers in a locally compact space is in general unsolvable, and this occurs even under very natural…
In 1927 Littlewood constructed an example of bounded holomorphic function on the unit disk, which diverges almost everywhere along rotated copies of any given curve in the unit disk ending tangentially to the boundary. This theorem was the…
The uncountability of the reals was first established by Cantor in what was later heralded as the first paper on set theory. Since the latter constitutes the official foundations of mathematics, the logical study of the uncountability of…
Quantum field theory - our basic framework for describing all non-gravitational physics - conflicts with general relativity: the latter precludes the standard definition of the former's essential principle of locality, in terms of commuting…
We study relative precompleteness in the context of the theory of numberings, and relate this to a notion of lowness. We introduce a notion of divisibility for numberings, and use it to show that for the class of divisible numberings,…
We prove the convergence case of Khintchine's theorem, with general approximation functions that are not necessarily monotonic, for analytic nonplanar manifolds over local fields of positive characteristic. Our approach is based on the…
In the general context of computable metric spaces and computable measures we prove a kind of constructive Borel-Cantelli lemma: given a sequence (constructive in some way) of sets $A_{i}$ with effectively summable measures, there are…
Through a reformulation of the local limit theorem and law of small numbers, which is obtained by working in the spaces naturally associated to the limiting distributions, we discover a general and abstract framework for the investigation…
In contexts in which the principle of dependent choice may not be available, as toposes or Constructive Set Theory, standard locale theoretic results related to complete regularity may fail to hold. To resolve this difficulty, B.…
Reverse Mathematics (RM for short) is a program in the foundations of mathematics where the aim is to find the minimal axioms needed to prove a given theorem of ordinary mathematics. Generally, the minimal axioms are equivalent to the…
In the first part of this paper we show that a set $E$ has locally finite $s$-perimeter if and only if it can be approximated in an appropriate sense by smooth open sets. In the second part we prove some elementary properties of local and…
The compactness phenomenon is one of the featured aspects of structuralism in mathematics. In simple and broad words, a compactness property holds in a structure if a related property is satisfied by sufficiently many substructures of that…
We give a direct proof of the local $Tb$ Theorem, in the Euclidean setting, and under the assumption of dual exponents. This Theorem provides a flexible framework for proving the boundedness of a Calder\'on-Zygmund operator, supposing the…
We identify computability-theoretic properties enabling us to separate various statements about partial orders in reverse mathematics. We obtain simpler proofs of existing separations, and deduce new compound ones. This work is part of a…
A standard Hilbert-space proof of Dirichlet's principle is simplified, using an observation that a certain form of min-problem has unique solution, at a specified point. This solves Dirichlet's problem, after it is recast in the required…
Every beginning real analysis student learns the classic Heine-Borel theorem, that the interval [0,1] is compact. In this article, we present a proof of this result that doesn't involve the standard techniques such as constructing a…
We discuss the possibility of constructing a function that validates the definition or not definition of the partial recursive functions of one variable. This is a topic in computability theory, which was first approached by Alan M. Turing…
We define a class of computable functions over real numbers using functional schemes similar to the class of primitive and partial recursive functions defined by G\"odel and Kleene. We show that this class of functions can also be…
This paper first proves two fixed point theorems in complete random normed modules, which are respectively the random generalizations of the classical Banach's contraction mapping principle and Browder--Kirk's fixed point theorem. As…
Proofs of Tychonoff's theorem often seem to require a bit of magic. Machinery such as ultrafilters, nets or maximal families with the finite intersection property are employed to give proofs that can be very neat, but not the kind of thing…