Related papers: Countable strict reverse mathematics

We show that the Priess-Crampe & Ribenboim fixed point theorem is provable in $\mathsf{RCA}_0$. Furthermore, we show that Caristi's fixed point theorem for both Baire and Borel functions is equivalent to the transfinite leftmost path…

A theory of recursive definitions has been mechanized in Isabelle's Zermelo-Fraenkel (ZF) set theory. The objective is to support the formalization of particular recursive definitions for use in verification, semantics proofs and other…

Cousin's lemma is a compactness principle that naturally arises when studying the gauge integral, a generalisation of the Lebesgue integral. We study the axiomatic strength of Cousin's lemma for various classes of functions, using Friedman…

We investigate reciprocals of false theta functions, producing results such as congruences, simple asymptotic bounds, and combinatorial identities. Of particular interest is a connection between $1/\Psi(-q^2,q)$ and the truncated pentagonal…

In the context of reverse mathematics, effective transfinite recursion refers to a principle that allows us to construct sequences of sets by recursion along arbitrary well orders, provided that each set is $\Delta^0_1$-definable relative…

It is quite well-known from Kurt Godel's (1931) ground-breaking result on the Incompleteness Theorem that rudimentary relations (i.e., those definable by bounded formulae) are primitive recursive, and that primitive recursive functions are…

Performative prediction is a framework accounting for the shift in the data distribution induced by the prediction of a model deployed in the real world. Ensuring rapid convergence to a stable solution where the data distribution remains…

Let $\mathsf{TT}^1$ be the combinatorial principle stating that every finite coloring of the infinite full binary tree has a homogeneous isomorphic subtree. Let $\mathsf{RT}^2_2$ and $\mathsf{WKL}_0$ denote respectively the principles of…

We prove, under certain conditions on $(\alpha,\beta)$, that each Schwartz function $f$ such that $f(\pm n^{\alpha}) = \hat{f}(\pm n^{\beta}) = 0, \forall n \ge 0$ must vanish identically, complementing a series of recent results involving…

We study the complexity of approximating the number of answers to a small query $\varphi$ in a large database $\mathcal{D}$. We establish an exhaustive classification into tractable and intractable cases if $\varphi$ is a conjunctive query…

Let $E$ be an arbitrary subset of the unit circle $T$ and let $f$ be a function defined on $E$. When there exist polynomials $P_n$ which are uniformly bounded by a number $M > 0$ on $T$ and converge (pointwise) to $f$ at each point of $E$?…

In this paper, we first give two uniform asymptotic approximations of the eigenfunctions of the weighted finite Fourier transform operator, defined by ${\displaystyle \mathcal F_c^{(\alpha)} f(x)=\int_{-1}^1 e^{icxy}…

We show that the axioms of Weak Kleene Algebra (WKA) are sound and complete for the theory of regular expressions modulo simulation equivalence, assuming their completeness for monodic trees (as conjectured by Takai and Furusawa).

We give axioms in the language of rings augmented by a 1-ary predicate symbol $Fin(x)$ with intended interpretation in the Boolean algebra of idempotents as the ideal of finite elements, i.e. finite unions of atoms. We prove that any…

Reverse Mathematics (RM) is a program in the foundations of mathematics founded by Friedman and developed extensively by Simpson. The aim of RM is finding the minimal axioms needed to prove a theorem of ordinary (i.e. non-set theoretical)…

We propose a generalisation of concurrent Kleene algebra \cite{Hoa09} that can take account of probabilistic effects in the presence of concurrency. The algebra is proved sound with respect to a model of automata modulo a variant of rooted…

We define weak units in a semi-monoidal 2-category $\CC$ as cancellable pseudo-idempotents: they are pairs $(I,\alpha)$ where $I$ is an object such that tensoring with $I$ from either side constitutes a biequivalence of $\CC$, and $\alpha:…

In this paper, we derive formulas for the Fr\'echet (singular) subdiferentials of the bilateral minimal time function $T:\mathbb{R}^n \times \mathbb{R}^n \to [0,+\infty]$ associated with a system governed by differential inclusions. As a…

We show that induction over $\Delta(\mathbb R)$-definable well-founded classes is equivalent to the reflection principle which asserts that any true formula of first order set theory with real parameters holds in some transitive set. The…

The Axiom of Choice (AC for short) is the most (in)famous axiom of the usual foundations of mathematics, ZFC set theory. The (non-)essential use of AC in mathematics has been well-studied and thoroughly classified. Now, fragments of…