Related papers: Turing-Taylor expansions for arithmetic theories
Taylor expansions of analytic functions are considered with respect to several points, allowing confluence of any of them. Cauchy-type formulas are given for coefficients and remainders in the expansions, and the regions of convergence are…
Japaridze's provability logic $GLP$ has one modality $[n]$ for each natural number and has been used by Beklemishev for a proof theoretic analysis of Peano aritmetic $(PA)$ and related theories. Among other benefits, this analysis yields…
We develop a theory of multiplicative functions (with values inside or on the unit circle) in arithmetic progressions analogous to the well-known theory of primes in arithmetic progressions.
The Euclidean algorithm makes possible a simple but powerful generalization of Taylor's theorem. Instead of expanding a function in a series around a single point, one spreads out the spectrum to include any number of points with given…
According to the math tea argument, there must be real numbers that we cannot describe or define, because there are uncountably many real numbers, but only countably many definitions. And yet, the existence of pointwise-definable models of…
Recent years have seen tremendous growth in the amount of verified software. Proofs for complex properties can now be achieved using higher-order theories and calculi. Complex properties lead to an ever-growing number of definitions and…
Motivated by the Pierce-Birkhoff conjecture, we launch an extension program for single variable expansivity theory. We study this notion under tuples of polynomials in the ring $\mathbb{R}[x_1,x_2,\ldots,x_n]$. As an application, we develop…
Provability logics are modal or polymodal systems designed for modeling the behavior of G\"odel's provability predicate in arithmetical theories and its natural extensions. If \Lambda is any ordinal, the G\"odel-L\"ob calculus GLP(\Lambda)…
We study transfinite extensions of Japaridze's provability logic GLP and the well-founded relations that naturally occur within them. Every ordinal induces a partial order over the class of "words," which are iterated consistency statements…
In this work we introduce a new concept, namely, $\tau_{s}$-extending modules (rings) which is torsion-theoretic analogues of extending modules and then we extend many results from extending modules to this new concept. For instance we show…
Throughout the course of mathematical history, generalizations of previously understood concepts and structures have led to the fruitful development of the hierarchy of number systems, non-euclidean geometry, and many other epochal phases…
The Turing degree of a real measures the computational difficulty of producing its binary expansion. Since Turing degrees are tailsets, it follows from Kolmogorov's 0-1 law that for any property which may or may not be satisfied by any…
Thimble regularisation is a possible solution to the sign problem, which is evaded by formulating quantum field theories on manifolds where the imaginary part of the action stays constant (Lefschetz thimbles). A major obstacle is due to the…
We establish new Bombieri-Vinogradov type estimates for a wide class of multiplicative arithmetic functions and derive several applications, including: a new proof of a recent estimate by Drappeau and Topacogullari for arithmetical…
The dimension of any module over an algebra of affiliated operators ${\mathcal U}$ of a finite von Neumann algebra ${\mathcal A}$ is defined using a trace on ${\mathcal A}.$ All zero-dimensional ${\mathcal U}$-modules constitute the torsion…
Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…
In mathematical logic there are two seemingly distinct kinds of principles called "reflection principles." Semantic reflection principles assert that if a formula holds in the whole universe, then it holds in a set-sized model. Syntactic…
We study the existence of formal Taylor expansions for functions defined on fields of generalised series. We prove a general result for the existence and convergence of those expansions for fields equipped with a derivation and an…
We generalise Ehrhard and Regnier's Taylor expansion from pure to probabilistic $\lambda$-terms through notions of probabilistic resource terms and explicit Taylor expansion. We prove that the Taylor expansion is adequate when seen as a way…
The notion of slow provability for Peano Arithmetic ($\mathsf{PA}$) was introduced by S.D. Friedman, M. Rathjen, and A. Weiermann. They studied the slow consistency statement $\mathrm{Con}_{\mathsf{s}}$ that asserts that a contradiction is…