Related papers: Conservation theorems on semi-classical arithmetic
This paper makes contributions to ``pure'' sheaf model theory, the part of model theory in which the models are sheaves over a complete Heyting algebra. We start by outlining the theory in a way we hope is readable for the non-specialist.…
We analyze the strength of the existence of idempotent ultrafilters in higher-order reverse mathematics. Let (Uidem) be the statement that an idempotent ultrafilter on the natural numbers exists. We show that over ACA_0^w, the higher-order…
We introduce a fragment of continuous first-order logic, analogue of Palyutin formulas (or h-formulas) in classical model theory, which is preserved under reduced products in both directions. We use it to extend classical results on…
We use the law of total variance to generate multiple expressions for the posterior predictive variance in Bayesian hierarchical models. These expressions are sums of terms involving conditional expectations and conditional variances. Since…
Vardanyan's Theorems state that $\mathsf{QPL}(\mathsf{PA})$ - the quantified provability logic of Peano Arithmetic - is $\Pi^0_2$ complete, and in particular that this already holds when the language is restricted to a single unary…
In this paper we present a detailed study of the quantum conservation laws for Toda field theories defined on the half plane in the presence of a boundary perturbation. We show that total derivative terms added to the currents, while…
We introduce the notion of effective Axiom A and use it to show that some popular tree forcings are Suslin+. We introduce transitive nep and present a simplified version of Shelah's "preserving a little implies preserving much": If I is a…
Let $\mathcal{PL}({\sf T},{\sf T}')$ and $\mathcal{PL}_{\Sigma_1}({\sf T},{\sf T}')$ respectively indicates the provability logic and $\Sigma_1$-provability logic of ${\sf T}$ relative in ${\sf T}'$. In this paper we characterize the…
Approximation algorithms for classical constraint satisfaction problems are one of the main research areas in theoretical computer science. Here we define a natural approximation version of the QMA-complete local Hamiltonian problem and…
We present and analyze $F_\sigma$-Mathias forcing, which is similar but tamer than Mathias forcing. In particular, we show that this forcing preserves certain weak subsystems of second-order arithmetic such as $\mathsf{ACA}_0$ and…
The derivation of the `classical' low-energy theorem (LET) for \gamma p \rightarrow p\pi^0 is re-examined and compared to chiral perturbation theory. Both results are correct and are not contradictory; they differ because different…
We consider $K$-semialgebras for a commutative semiring $K$ that are at the same time $\Sigma$-algebras and satisfy certain linearity conditions. When each finite system of guarded polynomial fixed point equations has a unique solution over…
We consider the foundational relation between arithmetic and set theory. Our goal is to criticize the construction of standard arithmetic models as providing grounds for arithmetic truth (even in a relative sense). Our method is to…
This paper concerns quasi-stochastic approximation (QSA) to solve root finding problems commonly found in applications to optimization and reinforcement learning. The general constant gain algorithm may be expressed as the…
Previously referred to as `miraculous' in the scientific literature because of its powerful properties and its wide application as optimal solution to the problem of induction/inference, (approximations to) Algorithmic Probability (AP) and…
Hamiltonian and action principle (HAP) formulations of plasma physics are reviewed for the purpose of explaining structure preserving numerical algorithms. Geometric structures associated with and emergent from HAP formulations are…
Let $H$ be a commutative semigroup with unit element such that every non-unit can be written as a finite product of irreducible elements (atoms). For every $k \in \mathbb N$, let $\mathscr U_k (H)$ denote the set of all $\ell \in \mathbb N$…
Using a theorem of partial differential equations, we present a general way of deriving the conserved quantities associated with a given classical point mechanical system, denoted by its Hamiltonian. Some simple examples are given to…
For each substance-like quantity, a theorem about its conservation or non-conservation can be formulated. For the electric charge e.g. it reads: Electric charge can neither be created nor destroyed. Such a statement is short and easy to…
We present a new structure called the "conservative matrix field", initially developed to elucidate and provide insight into the methodologies employed by Ap\'ery's in his proof of the irrationality of the Riemann zeta function at 3. This…