Related papers: A Friedman--Sheard-style Theory for Classical Real…
We utilize a combination of integral transforms, including the Laplace transform, with some classical results in analytic number theory concerning the Riemann $\xi$-function, to obtain a new integral equation. We also provide a new proof of…
Assuming the Riemann hypothesis, we prove the latest explicit version of the prime number theorem for short intervals. Using this result, and assuming the generalised Riemann hypothesis for Dirichlet $L$-functions is true, we then establish…
In this work, we show that the proof of the main result in [An Application of Hayashi's Inequality for Differentiable Functions, Computers & Mathematics with Applications, 32 (6) (1996), 95--99, by R.P. Agarwal and S.S. Dragomir] was wrong.…
Quantum computing enables the efficient resolution of complex problems, often outperforming classical methods across various applications. In 2009, Harrow, Hassidim and Lloyd proposed an algorithm for solving linear systems of equations,…
Let $\mathcal{T}$ be any of the three canonical truth theories $\textsf{CT}^-$ (Compositional truth without extra induction), $\textsf{FS}^-$ (Friedman--Sheard truth without extra induction), and $\textsf{KF}^-$ (Kripke--Feferman truth…
The incompatibility between the treatment of time in the classical and in the quantum theory results in the so-called problem of time in canonical quantum gravity. For this reason, attempts have been made to devise algorithms of…
A simple expression for calculating the classical potential concerning $D$-dimensional gravitational models is obtained through a method based on the generating functional. The prescription is then used as a mathematical tool to probe the…
We show how to transform into programs the proofs in classical Analysis which use the existence of an ultrafilter on the integers. The method mixes the classical realizability introduced by the author, with the "forcing" of P. Cohen. The…
As one of the longest-running computer-assisted formal mathematics projects, large tracts of mathematical knowledge have been formalized with the help of the Mizar system. Because Mizar is based on first-order classical logic and set…
A choice of first-order variables for the characteristic problem of the linearized Einstein equations is found which casts the system into manifestly well-posed form. The concept of well-posedness for characteristic problems invoked is that…
The Riemann zeta function, and more generally the L-functions of Dirichlet characters, are among the central objects of study in number theory. We report on a project to formalize the theory of these objects in Lean's "Mathlib" library,…
A formulation of abelian and non-abelian chiral gauge theories is presented together with arguments for the unitarity and renormalisability in four dimensions. IASSNS-HEP-94/70, UM-P-94/96, and RCHEP-94/26.
In this short note we answer to a question of group theory from arXiv:0910.5080. In that paper the author describes the set of realizable Steinitz classes for so-called $A'$-groups of odd order, obtained iterating some direct and semidirect…
Based on the Sheaf Logic approach to set theoretic forcing, a hierarchy of Quantum Variable Sets is constructed which generalizes and simplifies the analogous construction developed by Takeuti on boolean valued models of set theory. Over…
In this paper, we define a new realizability semantics for the simply typed lambda-mu-calculus. We show that if a term is typable, then it inhabits the interpretation of its type. We also prove a completeness result of our realizability…
Classical first-order logic is in many ways central to work in mathematics, linguistics, computer science and artificial intelligence, so it is worthwhile to define it in full detail. We present soundness and completeness proofs of a…
This paper presents categorical formulations of Turing, Medvedev, Muchnik, and Weihrauch reducibilities in Computability Theory, utilizing Lawvere doctrines. While the first notions lend themselves to a smooth categorical presentation,…
It was shown by M.A. Nielsen and I.L. Chuang 1997, that it is impossible to build strictly universal programmable quantum gate array, that could perform any unitary operation precisely and it was suggested to use probabilistic gate arrays…
One of the basic observations of the classical world is that physical entities are real and can be distinguished from each other. However, within quantum theory, the idea of physical realism is not well established. A framework to analyse…
The generalized second-order partial derivatives of 1/r, where r is the radial distance in 3D, are obtained using a result of the potential theory of classical analysis. Some non-spherical regularization alternatives to the standard…