Related papers: Countable strict reverse mathematics
We study the computational expressivity of proof systems with fixed point operators, within the 'proofs-as-programs' paradigm. We start with a calculus muLJ (due to Clairambault) that extends intuitionistic logic by least and greatest…
We prove, in ZF+$\bf\Sigma^1_2$-determinacy, that for any analytic equivalence relation $E$, the following three statements are equivalent: (1) $E$ does not have perfectly many classes, (2) $E$ satisfies hyperarithmetic-is-recursive on a…
We study the arithmetic Fourier transforms of trace functions on general connected commutative algebraic groups. To do so, we first prove a generic vanishing theorem for twists of perverse sheaves by characters, and using this tool, we…
We study the reverse mathematics of countable analogues of several maximality principles that are equivalent to the axiom of choice in set theory. Among these are the principle asserting that every family of sets has a $\subseteq$-maximal…
Some elementary rigorous remark about the replica formalism in the Statistical Physics' approach to threshold phenomena in Computational Complexity Theory is presented.
Constructing a Pseudo Random Function (PRF) is a fundamental problem in cryptology. Such a construction, implemented by truncating the last $m$ bits of permutations of $\{0, 1\}^{n}$ was suggested by Hall et al. (1998). They conjectured…
We show that there are Turing complete computably enumerable sets of arbitrarily low non-trivial initial segment prefix-free complexity. In particular, given any computably enumerable set $A$ with non-trivial prefix-free initial segment…
New energy-density functionals (EDFs) inspired by effective-field theories (EFTs) have been recently proposed. The present work focuses on three of such functionals which were developed to produce satisfactory equations of state for nuclear…
Two theorems of elmentary arithmetic, one stating that the sum of the reciprocals of any number of consecutive positive integers is never an integer, and a generalization thereof by Trygve Nagell, are shown to be provable inside a very weak…
We introduce an interesting method of proving separable reduction theorems - the method of elementary submodels. We are studying whether it is true that a set (function) has given property if and only if it has this property with respect to…
Strong bisimulation for labelled transition systems is one of the most fundamental equivalences in process algebra, and has been generalised to numerous classes of systems that exhibit richer transition behaviour. Nearly all of the ensuing…
In the article integer divisibility properties and related prime factors natural number representation concepts have been defined over the whole infinite hyperoperation hierarchy. The definitions have been made across and above of unique…
The Minimalist Foundation, for short MF, was conceived by the first author with G. Sambin in 2005, and fully formalized in 2009, as a common core among the most relevant constructive and classical foundations for mathematics. To better…
We obtain weak type (1,1) estimates for the inverses of truncated discrete rough Hilbert transform. We include an ex- ample showing that our result is sharp. One of the ingredients of the proof are regularity estimates for convolution of…
Let $\mathfrak M=(M,\mathcal X)$ be a model of $\mathsf{RCA}_0+\text{$\Sigma^0_2$-bounding}$ in which $\Sigma^0_2(A)$-induction fails for some $A\in\mathcal X$. We show that (i) if $\mathfrak M$ is a model of the combinatorial principle…
No natural principle is currently known to be strictly between the arithmetic comprehension axiom (ACA) and Ramsey's theorem for pairs (RT^2_2) in reverse mathematics. The tree theorem for pairs (TT^2_2) is however a good candidate. The…
Foundation models for tabular data, such as the Tabular Prior-data Fitted Network (TabPFN), are pre-trained on a massive number of synthetic datasets generated by structural causal models (SCM). They leverage in-context learning to offer…
We study the first-order consequences of Ramsey's Theorem for $k$-colourings of $n$-tuples, for fixed $n, k \ge 2$, over the relatively weak second-order arithmetic theory $\mathrm{RCA}^*_0$. Using the Chong-Mourad coding lemma, we show…
Correlators of unitary quantum field theories in Lorentzian signature obey certain analyticity and positivity properties. For interacting unitary CFTs in more than two dimensions, we show that these properties impose general constraints on…
The pcf theorem (of the possible cofinality theory) was proved for reduced products prod_{i< kappa} lambda_i/I, where kappa < min_{i< kappa} lambda_i. Here we prove this theorem under weaker assumptions such as wsat(I)< min_{i< kappa}…