Related papers: Dilators and the reverse mathematics zoo
A replicator equation with mutation processes is numerically studied. Without any mutations, two characteristics of the replicator dynamics are known: an exponential divergence of the dominance period, and hierarchical orderings of the…
We have previously established that $\Pi^1_1$-comprehension is equivalent to the statement that every dilator has a well-founded Bachmann-Howard fixed point, over $\mathbf{ATR_0}$. In the present paper we show that the base theory can be…
In the framework leading to the multiplicative anomaly formula ---which is here proven to be valid even in cases of known spectrum but non-compact manifold (very important in Physics)--- zeta-function regularisation techniques are shown to…
The centralizer of a matrix in a full matrix algebra is called a principal centralizer matrix algebra. Characterizations are presented for principal centralizer matrix algebras to be Morita equivalent, almost $\nu$-stable derived…
The reticulation of an algebra $A$ is a bounded distributive lattice ${\cal L}(A)$ whose prime spectrum of filters or ideals is homeomorphic to the prime spectrum of congruences of $A$, endowed with the Stone topologies. We have obtained a…
For $0<r<1$, let us consider the following annulus: \[ \mathbb A_r= \{ z\in \mathbb C\, : \, r<|z|<1 \}. \] A Hilbert space operator $T$ for which $\overline{\mathbb A}_r$ is a spectral set is called an $\mathbb A_r$-\textit{contraction}.…
We show that arithmetical transfinite recursion is equivalent to a suitable formalization of the following: For every ordinal $\alpha$ there exists an ordinal $\beta$ such that $1+\beta\cdot(\beta+\alpha)$ (ordinal arithmetic) admits an…
We generalize the notion of saturated order to infinite partial orders and give both a set-theoretic and an algebraic characterization of such orders. We then study the proof theoretic strength of the equivalence of these characterizations…
Given a renormalizable theory we construct the dilatation operator, in the sense of generator of RG flow of composite operators. The generator is found as a differential operator acting on the space of normal symbols of composite operators…
Several theorems about the equivalence of familiar theories of reverse mathematics with certain well-ordering principles have been proved by recursion-theoretic and combinatorial methods (Friedman, Marcone, Montalban et al.) and with…
(1) Let $A$ be an operator on a space ${\cal H}$ of even finite dimension. Then for some decomposition ${\cal H}={\cal F}\oplus{\cal F}^{\perp}$, the compressions of $A$ onto ${\cal F}$ and ${\cal F}^{\perp}$ are unitarily equivalent. (2)…
Self-modification is often taken as constitutive of artificial superintelligence (SI), yet modification is a relative action requiring a supplement outside the operation. When self-modification extends to this supplement, the classical…
After an apparent hiatus of roughly 30 years, we revisit a seemingly neglected subject in the theory of (one-dimensional) cellular automata: sublinear-time computation. The model considered is that of ACAs, which are language acceptors…
We introduce a notion of pre-alternative algebra which may be seen as an alternative algebra whose product can be decomposed into two pieces which are compatible in a certain way. It is also the "alternative" analogue of a dendriform…
Motivated by a general dilation theory for operator-valued measures, framings and bounded linear maps on operator algebras, we consider the dilation theory of the above objects with special structures. We show that every operator-valued…
A Dirichlet operator algebra is a nonself-adjoint operator algebra $\mathcal{A}$ with the property that $\mathcal{A} + \mathcal{A}^*$ is norm-dense in the C$^*$-envelope of $\mathcal{A}.$ We show that, under certain restrictions,…
For any partial combinatory algebra (PCA for short) A, the class of A-representable partial functions from N to A quotiented by the filter of cofinite sets of N, is a PCA such that the representable partial functions are exactly the…
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…
The Sigma formulas of the language of arithmetic express semidecidable relations on the natural numbers. More generally, whenever a totality of objects is regarded as incomplete, the Sigma formulas express relations that are witnessed in a…
Conformal predictors provide set or functional predictions that are valid under the assumption of randomness, i.e., under the assumption of independent and identically distributed data. The question asked in this paper is whether there are…