Related papers: Slow Reflection
We define a natural notion of higher order stability and show that subsets of $\mathbb{F}_p^n$ that are tame in this sense can be approximately described by a union of low-complexity quadratic varieties, up to linear error. This generalizes…
It is well-known that natural axiomatic theories are well-ordered by consistency strength. However, it is possible to construct descending chains of artificial theories with respect to consistency strength. We provide an explanation of this…
We show that it is provable in PA that there is an arithmetically definable sequence $\{\phi_{n}:n \in \omega\}$ of $\Pi^{0}_{2}$-sentences, such that - PRA+$\{\phi_{n}:n \in \omega\}$ is $\Pi^{0}_{2}$-sound and $\Pi^{0}_{1}$-complete - the…
We prove several important results concerning existence and uniqueness of pseudo almost automorphic (paa) solutions with measure for integro-differential equations with reflection. We use the properties of almost automorphic functions with…
Recently, Artemov [4] offered the notion of constructive consistency for Peano Arithmetic and generalized it to constructive truth and falsity in the spirit of Brouwer-Heyting-Kolmogorov semantics and its formalization, the Logic of Proofs.…
We define a weak iterability notion that is sufficient for a number of arguments concerning $\Sigma_1$-definability at uncountable regular cardinals. In particular we give its exact consistency strength firstly in terms of the second…
We investigate the theory PAI (Peano Arithmetic with Indiscernibles). Models of PAI are of the form (M, I), where M is a model of PA, I is an unbounded set of order indiscernibles over M, and (M, I) satisfies the extended induction scheme…
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 stability of quantum motion of classically regular systems in presence of small perturbations. Onthe base of a uniform semiclassical theory we derive the fidelity decay which displays a quite complexbehaviour, from Gaussian to…
This paper presents new constructions of models of Hume's Principle and Basic Law V with restricted amounts of comprehension. The techniques used in these constructions are drawn from hyperarithmetic theory and the model theory of fields,…
We introduce a regularity method for sparse graphs, with new regularity and counting lemmas which use the Schatten-von-Neumann norms to measure uniformity. This leads to $k$-cycle removal lemmas in subgraphs of mildly-pseudorandom graphs,…
The arithmetic regularity lemma for $\mathbb{F}_p^n$, proved by Green in 2005, states that given a subset $A\subseteq \mathbb{F}_p^n$, there exists a subspace $H\leq \mathbb{F}_p^n$ of bounded codimension such that $A$ is Fourier-uniform…
In this paper, we study a class of slow-fast stochastic partial differential equations with multiplicative Wiener noise. Under some appropriate conditions, we prove the slow component converges to the solution of the corresponding averaged…
General mathematical reasoning is computationally undecidable, but humans routinely solve new problems. Moreover, discoveries developed over centuries are taught to subsequent generations quickly. What structure enables this, and how might…
Combining stationary reflection (a compactness property) with the failure of SCH (an instance of non-compactness) has been a long-standing theme. We obtain this at $\aleph_{\omega_1}$, answering a question of Ben-Neria, Hayut, and Unger: We…
The notion of replicable algorithms was introduced in Impagliazzo et al. [STOC '22] to describe randomized algorithms that are stable under the resampling of their inputs. More precisely, a replicable algorithm gives the same output with…
Using a result of recursive function theory and results of the complex analysis of Takeuti, which is based on a type theory and the work of Kreisel, and which gives a conservative extension of first order Peano arithmetic (PA), assuming all…
This work is about the synchronization of nonlinear coupled dynamical systems driven by $\alpha$-stable noise. Firstly, we provide a novel technique to construct the relationship between synchronized system and slow-fast system. Secondly,…
This paper introduces new notions of asymptotic proofs, PT(polynomial-time)-extensions, PTM(polynomial-time Turing machine)-omega-consistency, etc. on formal theories of arithmetic including PA (Peano Arithmetic). This paper shows that P…
We introduce the Prediction Advantage (PA), a novel performance measure for prediction functions under any loss function (e.g., classification or regression). The PA is defined as the performance advantage relative to the Bayesian risk…