Related papers: Slow Reflection
The notion of slow entropy, both upper and lower slow entropy, was defined by Katok and Thouvenot as a more refined measure of complexity for dynamical systems, than the classical Kolmogorov-Sinai entropy. For any subexponential rate…
This paper presents a new representation of natural numbers and discusses its consequences for computability and computational complexity. The paper argues that the introduction of the first Peano axiom in the traditional definition of…
In 1994 Jech gave a model theoretic proof of G\"odel's second incompleteness theorem for Zermelo-Fraenkel set theory in the following form: ZF does not prove that ZF has a model. Kotlarski showed that Jech's proof can be adapted to Peano…
Separation logic is successful for software verification of heap-manipulating programs. Numbers are necessary to be added to separation logic for verification of practical software where numbers are important. However, properties of the…
A stationary subset S of a regular uncountable cardinal kappa reflects fully at regular cardinals if for every stationary set T subseteq kappa of higher order consisting of regular cardinals there exists an alpha in T such that S cap alpha…
We consider a one-parameter family of beam equations with Hamiltonian non-linearity in one space dimension under periodic boundary conditions. In a unified functional framework we study the long time evolution of initial data in two…
The Axiom of Full Reflection at a measurable cardinal has been conjectured to be equiconsitent with the existence of a coherent sequence of measures with a repeat point. However we prove that the Axiom of Full Reflection at a measurable…
This paper presents a formal theory of Krivine's classical realisability interpretation for first-order Peano arithmetic ($\mathsf{PA}$). To formulate the theory as an extension of $\mathsf{PA}$, we first modify Krivine's original…
We construct a Hunt process that can be described as an isotropic $\alpha$-stable L\'evy process reflected from the complement of a bounded open Lipschitz set. In fact, we introduce a new analytic method for concatenating Markov processes.…
Historically, spectroscopic techniques have been essential for studying the optical properties of thin solid films. However, existing formulae for both normal transmission and reflection spectroscopy often rely on simplified theoretical…
In this paper, the averaging principle is studied for a class of multiscale stochastic partial differential equations driven by $\alpha$-stable process, where $\alpha\in(1,2)$. Using the technique of Poisson equation, the orders of strong…
Computability logic (CoL) provides a semantic foundation in which formulas represent interactive computational problems and validity corresponds to uniform algorithmic solvability. Building on this foundation, clarithmetics -- CoL-based…
Non-Hermitian photonic systems capable of perfectly absorbing incident radiation recently attracted much attention both because fundamentally they correspond to an exotic scattering phenomenon (a real-valued scattering matrix zero) and…
In this paper, we study the averaging principle for a class of stochastic differential equations driven by $\alpha$-stable processes with slow and fast time-scales, where $\alpha\in(1,2)$. We prove that the strong and weak convergence order…
Regular resolution is a refinement of the resolution proof system requiring that no variable be resolved on more than once along any path in the proof. It is known that there exist sequences of formulas that require exponential-size proofs…
In this paper, we consider a class of slow-fast systems of stochastic partial differential equations where the nonlinearity in the slow equation is not continuous and unbounded. We first provide conditions that ensure the existence of a…
A stationary subset $S$ of a regular uncountable cardinal $\kappa$ {\it reflects fully} at regular cardinals if for every stationary set $T \subseteq \kappa$ of higher order consisting of regular cardinals there exists an $\alpha \in T$…
Rapid advancements in data science require us to have fundamentally new frameworks to tackle prevalent but highly non-trivial "irregular" inference problems, to which the large sample central limit theorem does not apply. Typical examples…
It is not surprising that one should expect that the degree of constrained (shape preserving) approximation be worse than the degree of unconstrained approximation. However, it turns out that, in certain cases, these degrees are the same.…
We analyse how the standard reductions between constraint satisfaction problems affect their proof complexity. We show that, for the most studied propositional, algebraic, and semi-algebraic proof systems, the classical constructions of…