Related papers: A note on fragments of uniform reflection in secon…
Consider a subset $A$ of $\mathbb{F}_p^n$ and a decomposition of its indicator function as the sum of two bounded functions $1_A=f_1+f_2$. For every family of linear forms, we find the smallest degree of uniformity $k$ such that assuming…
We show that induction over $\Delta(\mathbb R)$-definable well-founded classes is equivalent to the reflection principle which asserts that any true formula of first order set theory with real parameters holds in some transitive set. The…
A version of the second main theorem of Nevanlinna theory is proved, where the ramification term is replaced by a term depending on a certain composition operator of a meromorphic function of small hyper-order. As a corollary of this result…
According to the Schwarz symmetry principle, every harmonic function vanishing on a real analytic curve has an odd continuation, while a harmonic function satisfying homogeneous Neumann condition has the even continuation. There are…
Koplienko \cite{Ko} found a trace formula for perturbations of self-adjoint operators by operators of Hilbert-Schmidt class $\mathcal{B}_2(\mathcal{H})$. Later, Neidhardt introduced a similar formula in the case of pair of unitaries…
We introduce ordinal collapsing principles that are inspired by proof theory but have a set theoretic flavor. These principles are shown to be equivalent to iterated $\Pi^1_1$-comprehension and the existence of admissible sets, over weak…
We study the properties of reflectionless measures for an $s$-dimensional Calder\'on-Zygmund operator $T$ acting in $\mathbb{R}^d$, where $s\in (0,d)$. Roughly speaking, these are the measures $\mu$ for which $T(\mu)$ is constant on the…
We investigate the set of Pi-1-2 sentences which are Pi-1-1 conservative over the theories of reverse mathematics RCA0+ISigma_n and ACA0. We exhibit new elements of these sets and conclude that the sets are Pi_2 complete. Along the way, we…
We study the expressive power of the two-variable fragment of order-invariant first-order logic. This logic departs from first-order logic in two ways: first, formulas are only allowed to quantify over two variables. Second, formulas can…
Undecidability of various properties of first order term rewriting systems is well-known. An undecidable property can be classified by the complexity of the formula defining it. This gives rise to a hierarchy of distinct levels of…
We study the arithmetic Fourier transforms of trace functions on general connected commutative algebraic groups. To do so, we first prove a generic vanishing theorem for twists of perverse sheaves by characters, and using this tool, we…
We study the reverse mathematics of characterization theorems of regular countable second countable spaces (or $CSCS$ for short). We prove that arithmetic comprehension is equivalent over $\textbf{RCA}_0$ to every $T_3$ $CSCS$ being…
A reasonably complete theory of the approximation of an irrational by rational fractions whose numerators and denominators lie in prescribed arithmetic progressions is developed in this paper. Results are both, on the one hand, from a…
We obtain a new general extension theorem in Banach spaces for operators which are not required to be symmetric, and apply it to obtain Harnack estimates and a priori regularity for solutions of fractional powers of several second order…
For a class $\Gamma$ of formulas, $\Gamma$ local reflection principle $\mathrm{Rfn}_{\Gamma}(T)$ for a theory $T$ of arithmetic is a scheme formalizing the $\Gamma$-soundness of $T$. Beklemishev proved that for every $\Gamma \in \{\Sigma_n,…
Kruskal's theorem famously states that finite trees (ordered using an infima-preserving embeddability relation) form a well partial order. Freund, Rathjen, and Weiermann extended this result to general recursive data types with their…
We construct here an iterative evaluation of all PR map codes: progress of this iteration is measured by descending complexity within "Ordinal" O := N[\omega] of polynomials in one indeterminate, ordered lexicographically. Non-infinit…
A formula $\phi$ is called \emph{$n$-provable} in a formal arithmetical theory $S$ if $\phi$ is provable in $S$ together with all true arithmetical $\Pi_{n}$-sentences taken as additional axioms. While in general the set of all $n$-provable…
Definite descriptions are first-order expressions that denote unique objects. In this paper, we propose a second-order counterpart, designed to refer to unique relations between objects. We investigate this notion within the framework of…
Many theorems of mathematics have the form that for a certain problem, e.g. a differential equation or polynomial (in)equality, there exists a solution. The sequential version then states that for a sequence of problems, there is a sequence…