Related papers: RCF4: Inconsistent Quantification
We use a second-order analogy $\mathsf{PRA}^2$ of $\mathsf{PRA}$ to investigate the proof-theoretic strength of theorems in countable algebra, analysis, and infinite combinatorics. We compare our results with similar results in the…
The statement of Lemma 3.1 in the published paper is not correct. Lemma 3.1 is needed for the proof of Theorem 3.2. Theorem 3.2 as originally stated is true but its "proof" is not correct. Here we change the statements and proofs of Lemma…
We prove the existence of the operator product expansion (OPE) in Euclidean Yang-Mills theories as a short-distance expansion, to all orders in perturbation theory. We furthermore show that the Ward identities of the underlying gauge theory…
Rice's theorem shows that nontrivial extensional properties of partial recursive functions are undecidable. For finite weighted Boolean optimization/CSP-style slices, a Rice-style structural analogue holds for tractability classification:…
In this paper we prove the following renewal-type limit theorem. Given an irrational $\alpha$ in (0,1) and R>0, let $q_{n_R}$ be the first denominator of the convergents of $\alpha$ which exceeds R. The main result in the paper is that the…
In this paper, we study the prescribed $Q$-curvature problem on closed four-dimensional Riemannian manifolds when the total integral of the $Q$-curvature is a positive integer multiple of the one of the four-dimensional round sphere. This…
This article describes a Turing machine which can solve for $\beta^{'}$ which is RE-complete. RE-complete problems are proven to be undecidable by Turing's accepted proof on the Entscheidungsproblem. Thus, constructing a machine which…
Higher-order quantum theory is an extension of quantum theory where one introduces transformations whose input and output are transformations, thus generalizing the notion of channels and quantum operations. The generalization then goes…
Consider a decision problem whose instance is a function. Its degree of undecidability, measured by the corresponding class of the arithmetic (or Kleene-Mostowski) hierarchy hierarchy, may depend on whether the instance is a partial…
For a (minimal) Arithmetical theory with higher Order Objects, i.e. a (minimal) Cartesian closed arithmetical theory -- coming as such with the corresponding closed evaluation -- we interprete here map codes, out of [A,B] say,into these…
In this work, some counterexamples are given to refute some results reported in the paper by Guo and Li [8] (J Optim Theory Appl 162,(2014), 821-844). We correct the faulty in some of their theorems and we present alternative proofs.…
Classical theory proves that every primitive recursive function is strongly representable in PA; that formal Peano Arithmetic, PA, and formal primitive recursive arithmetic, PRA, can both be interpreted in Zermelo-Fraenkel Set Theory, ZF;…
We investigate quantization coefficients for self-similar probability measures \mu on limit sets which are generated by systems S of infinitely many contractive similarities and by probabilistic vectors. The theory of quantization…
We consider the problem of positive-semidefinite continuation: extending a partially specified covariance kernel from a subdomain $\Omega$ of a rectangular domain $I\times I$ to a covariance kernel on the entire domain $I\times I$. For a…
We study the inverse problem of parameter identification in non-coercive variational problems that commonly appear in applied models. We examine the differentiability of the set-valued parameter-to-solution map by using the first-order and…
We introduce techniques for turning estimates on the infinitesimal behavior of solutions to nonlinear equations (statements concerning tangent cones and blow ups) into more effective control. In the present paper, we focus on proving…
Let $M$ be a smooth manifold equipped with a conformal structure, $E[w]$ the space of densities with the the conformal weight $w$ and $D_{w,w+\de}$ the space of differential operators from $E[w]$ to $E[w+\delta]$. Conformal quantization $Q$…
For the Hermitian inexact Rayleigh quotient iteration (RQI), we present a new general theory, independent of iterative solvers for shifted inner linear systems. The theory shows that the method converges at least quadratically under a new…
We present a new technique for proving logarithmic upper bounds for diameters of evolving random graph models, which is based on defining a coupling between random graphs and variants of random recursive trees. The advantage of the…
In reverse mathematics, is is possible to have a curious situation where we know that an implication does not reverse, but appear to have no information on on how to weaken the assumption while preserving the conclusion. A main cause of…