Related papers: Transfinite Recursion in Higher Reverse Mathematic…
The Landau-Lifshitz equation is the first in an infinite series of approximations to the Lorentz-Abraham-Dirac equation obtained from `reduction of order'. We show that this series is divergent, predicting wildly different dynamics at…
We introduce an explicit logarithmic transformation $T(x) = \{\log_6(x + 1/5)\}$ under which the Collatz map becomes a rigid circle rotation by the irrational angle \(\alpha = \log_6 3\), perturbed by a uniformly bounded error term. We…
We show that when certain statements are provable in subsystems of constructive analysis using intuitionistic predicate calculus, related sequential statements are provable in weak classical subsystems. In particular, if a $\Pi^1_2$…
Computational reflection allows us to turn verified decision procedures into efficient automated reasoning tools in proof assistants. The typical applications of such methodology include mathematical structures that have decidable theory…
Task-adaptive pre-training (TAPT) alleviates the lack of labelled data and provides performance lift by adapting unlabelled data to downstream task. Unfortunately, existing adaptations mainly involve deterministic rules that cannot…
Reverse differentiation is an essential operation for automatic differentiation. Cartesian reverse differential categories axiomatize reverse differentiation in a categorical framework, where one of the primary axioms is the reverse chain…
The paper is devoted to a reverse-mathematical study of some well-known consequences of Ramsey's theorem for pairs, focused on the chain-antichain principle $\mathsf{CAC}$, the ascending-descending sequence principle $\mathsf{ADS}$, and the…
This article consists of an introduction to Iyama's higher Auslander-Reiten theory for Artin algebras from the viewpoint of higher homological algebra. We provide alternative proofs of the basic results in higher Auslander-Reiten theory,…
We represent the generalized Collatz function with the recursive ruler function r(2n) = r(n) + 1 and r(2n + 1) = 1. We generate even-only and odd-only Collatz subsequences that contain significantly fewer elements term by term, to 2 and 1,…
In this paper we introduce a special kind of relative (co)resolutions associated to a pair of classes of objects in an abelian category $\mathcal{C}.$ We will see that, by studying these relative (co)resolutions, we get a possible…
We study the conservativity of extensions by additional strict equalities of dependent type theories (and more general second-order generalized algebraic theories). The conservativity of Extensional Type Theory over Intensional Type Theory…
The program Reverse Mathematics (RM for short) seeks to identify the axioms necessary to prove theorems of ordinary mathematics, usually working in the language of second-order arithmetic $L_{2}$. A major theme in RM is therefore the study…
Plato is well-known in mathematics for the eponymous foundational philosophy Platonism based on ideal objects. Plato's allegory of the cave provides a powerful visual illustration of the idea that we only have access to shadows or…
When the Canonical Ramsey's Theorem by Erd\H{o}s and Rado is applied to regressive functions one obtains the Regressive Ramsey's Theorem by Kanamori and McAloon. Taylor proved a "canonical" version of Hindman's Theorem, analogous to the…
This paper presents two types of results related to hyperarithmetic analysis. First, we introduce new variants of the dependent choice axiom, namely $\mathrm{unique}~\Pi^1_0(\mathrm{resp.}~\Sigma^1_1)\text{-}\mathsf{DC}_0$ and…
We consider the restriction of Ramsey's theorem that arises from considering only translation-invariant colourings of pairs, and show that this has the same strength (both from the viewpoint of Reverse Mathematics and from the viewpoint of…
Cut-elimination theorems constitute one of the most important classes of theorems of proof theory. Since Gentzen's proof of the cut-elimination theorem for the system $\mathbf{LK}$, several other proofs have been proposed. Even though the…
We extend theories of reverse mathematics by a non-principal ultrafilter, and show that these are conservative extensions of the usual theories ACA0, ATR0, and Pi11-Comprehension.
WWe give a rational closed form expression for the higher derivatives of the inverse tangent function and discuss its relation to Chebyshev polynomials, trigonometric expansions and Appell sequences of polynomials.
We study the computational strength of resetting $\alpha$-register machines, a model of transfinite computability introduced by P. Koepke in \cite{K1}. Specifically, we prove the following strengthening of a result from \cite{C}: For an…