Related papers: Slow and Ordinary Provability for Peano Arithmetic
We show that "The product of consecutive integers is never a power" and several results by Schinzel and Tijdeman on the solutions of the equation $y^m=P(x)$, for $m>1$, $y>1$, and $P(x)$ a polynomial with rational coefficients and with at…
In this work we study the averaging principle for non-autonomous slow-fast systems of stochastic differential equations. In particular in the first part we prove the averaging principle assuming the sublinearity, the Lipschitzianity and the…
Throughout the course of mathematical history, generalizations of previously understood concepts and structures have led to the fruitful development of the hierarchy of number systems, non-euclidean geometry, and many other epochal phases…
It is a well known empirical observation that natural axiomatic theories are pre-well-ordered by consistency strength. For any natural theory $T$, the next strongest natural theory is $T+\mathsf{Con}_T$. We formulate and prove a statement…
Using a new strategy, we extend the classical Nekhoroshev's estimates to the case of H\"older regular steep near-integrable hamiltonian systems, the stability times being polynomially long in the inverse of the size of the perturbation. We…
We focus on the persistence principle over weak interpretability logic. Our object of study is the logic obtained by adding the persistence principle to weak interpretability logic from several perspectives. Firstly, we prove that this…
We investigate weak convergence of measures generated by solutions of stochastic equations with local time and small diffusion while the last one tends to zero. In case the correspondent ordinary differential equation has infinitely many…
We present a natural restriction of Hindman's Finite Sums Theorem that admits a simple combinatorial proof (one that does not also prove the full Finite Sums Theorem) and low computability-theoretic and proof-theoretic upper bounds, yet…
We study when a sound arithmetic theory $\mathcal S{\supseteq}S^1_2$ with polynomial-time decidable axioms efficiently proves the bounded consistency statements $Con_{\mathcal S{+}\phi}(n)$ for a true sentence $\phi$. Equivalently, we ask…
Over the last decades, two distinct approaches have been instrumental to our understanding of the computational complexity of statistical estimation. The statistical physics literature predicts algorithmic hardness through local stability…
Propositional dynamic logic (PDL) is presented in Sch\"{u}tte-style mode as one-sided semiformal tree-like sequent calculus Seq$_\omega^{\text{pdl}}$ with standard cut rule and the omega-rule with principal formulas $\left[ P^{\ast }\right]…
We pose the fine-grained hardness hypothesis that the textbook algorithm for the NFA Acceptance problem is optimal up to subpolynomial factors, even for dense NFAs and fixed alphabets. We show that this barrier appears in many variations…
This paper investigates the stability and convergence properties of asynchronous stochastic approximation (SA) algorithms, with a focus on extensions relevant to average-reward reinforcement learning. We first extend a stability proof…
This paper analyzes the limit properties of the empirical process of $\alpha$-stable random variables with long range dependence. The $\alpha$-stable random variables are constructed by non-linear transformations of bivariate sequences of…
The generally accepted wisdom in computational circles is that pure proof verification is a solved problem and that the computationally hard elements and fertile areas of study lie in proof discovery. This wisdom presumably does hold for…
We study a stability property of probability laws with respect to small violations of algorithmic randomness. A sufficient condition of stability is presented in terms of Schnorr tests of algorithmic randomness. Most probability laws, like…
The main goal of this paper is to study compactifications of polynomial slow-fast systems. More precisely, the aim is to give conditions in order to guarantee normal hyperbolicity at infinity of the Poincar\'e-Lyapunov sphere for slow-fast…
In a recent paper, Herbelin developed dPA${^\omega}$, a calculus in which constructive proofs for the axioms of countable and dependent choices could be derived via the memoization of choice functions. However, the property of normalization…
We consider the pricing and the sensitivity calculation of continuously monitored barrier options. Standard Monte Carlo algorithms work well for pricing these options. Therefore they do not behave stable with respect to numerical…
We introduce a strategy to tackle some known obstructions of current approaches to the Fourier uniformity conjecture. Assuming GRH, we then show the conjecture holds for intervals of length at least $(\log X)^{\psi(X)}$, with $\psi(X)…