Related papers: Turing-Taylor expansions for arithmetic theories
We formulate the Asymptotic Expansion Conjecture for the Witten-Reshetikhin-Turaev quantum invariants of closed oriented three manifolds. For finite order mapping tori, we study these quantum invariants via the geometric gauge theory…
In this paper we engage in a general study of the asymptotic expansion of the Witten-Reshetikhin-Turaev invariants of mapping tori of surface mapping class group elements. We use the geometric construction of the Witten-Reshetikhin-Turaev…
The differential $\lambda$-calculus studies how the quantitative aspects of programs correspond to differentiation and to Taylor expansion inside models of linear logic. Recent work has generalized the axioms of Taylor expansion so they…
The paper explores known results related to the problem of identifying if a given program terminates on all inputs -- this is a simple generalization of the halting problem. We will see how this problem is related and the notion of proof…
We investigate the cyclic proof theory of extensions of Peano Arithmetic by (finitely iterated) inductive definitions. Such theories are essential to proof theoretic analyses of certain `impredicative' theories; moreover, our cyclic systems…
The lambda-Pi-calculus modulo theory is a logical framework in which many type systems can be expressed as theories. We present such a theory, the theory U, where proofs of several logical systems can be expressed. Moreover, we identify a…
The overarching theme of the following pages is that mathematical logic -- centered around the incompleteness theorems -- is first and foremost an investigation of $\textit{computation}$, not arithmetic. Guided by this intuition we will…
We extend the recently introduced setting of coherent differentiation for taking into account not only differentiation, but also Taylor expansion in categories which are not necessarily (left)additive. The main idea consists in extending…
This paper introduces new notions of asymptotic proofs, PT(polynomial-time)-extensions, PTM(polynomial-time Turing machine)-omega-consistency, etc. on formal theories of arithmetic including PA (Peano Arithmetic). This paper shows that P…
The theory of Touchard polynomials is generalized using a method based on the definition of exponential operators, which extend the notion of the shift operator. The proposed technique, along with the use of the relevant operational…
We develop a new approach to prove multiplier theorems in various geometric settings. The main idea is to use martingale transforms and a Gundy-Varopoulos representation for multipliers defined via a suitable extension procedure. Along the…
By Solovay's celebrated completeness result on formal provability we know that the provability logic $\mathrm GL$ describes exactly all provable structural properties for any sound and strong enough arithmetical theory with a decidable…
We consider extensions of the language of Peano arithmetic by transfinitely iterated truth definitions satisfying uniform Tarskian biconditionals. Without further axioms, such theories are known to be conservative extensions of the original…
The Taylor expansion is a widely used and powerful tool in all branches of Mathematics, both pure and applied. In Probability and Mathematical Statistics, however, a stronger version of Taylor's classical theorem is often needed, but only…
The addition of polymers fundamentally alters the dynamics of turbulent flows in a way that defies Kolmogorov predictions. However, we now present a formalism that reconciles our understanding of polymeric turbulence with the classical…
For $N \in \mathbb{N}$, let $T_{N}$ be the Chebyshev polynomial of the first kind. Expressions for the sequence of numbers $p_{\ell}^{(N)}$, defined as the coefficients in the expansion of $1/T_{N}(1/z)$, are provided. These coefficients…
Ordinal analysis is a research program wherein recursive ordinals are assigned to axiomatic theories. According to conventional wisdom, ordinal analysis measures the strength of theories. Yet what is the attendant notion of strength? In…
Starting from one-range addition theorems for Slater-type functions, which are expansion in terms of complete and orthonormal functions based on the generalized Laguerre polynomials, Guseinov constructed addition theorems that are…
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncountably many) distributions are not, this imposes a strong…
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length $\omega$ to computations on tapes of arbitrary ordinal length. We show that a set of ordinals is ordinal computable from a finite…