Related papers: Arithmetic with Limited Exponentiation

Amplitudes in open topological string theory may be described completely by certain A-infinity-categories. We detail a general construction of all cyclic minimal models for a given A-infinity-algebra and apply this result to the case of N=2…

We investigate the computational properties of basic mathematical notions pertaining to $\mathbb{R}\rightarrow \mathbb{R}$-functions and subsets of $\mathbb{R}$, like finiteness, countability, (absolute) continuity, bounded variation,…

We present a polynomial time algorithm to approximately scale tensors of any format to arbitrary prescribed marginals (whenever possible). This unifies and generalizes a sequence of past works on matrix, operator and tensor scaling. Our…

Let $G$ be a connected and simply connected semisimple algebraic group over $\Bbb Q$ and let $\Gamma\subset G(\Bbb Q)$ be an arithmetic subgroup. Let $K_\infty\subset G(\Bbb R)$ be a maximal compact subgroup and let $d$ be the dimension of…

In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…

For any fixed positive integer $k$, let $\alpha_{k}$ denote the smallest $\alpha \in (0,1)$ such that the random graph sequence $\left\{G\left(n, n^{-\alpha}\right)\right\}$ does not satisfy the zero-one law for the set $\mathcal{E}_{k}$ of…

In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can be continuously or computably transferred into each other? For this…

We consider a monotone submodular maximization problem whose constraint is described by a logic formula on a graph. Formally, we prove the following three `algorithmic metatheorems.' (1) If the constraint is specified by a monadic…

Our capacity to process information depends on the computational power at our disposal. Information theory captures our ability to distinguish states or communicate messages when it is unconstrained with unrivaled beauty and elegance. For…

Let $A \cong k\langle X \rangle / I$ be an associative algebra. A finite word over alphabet $X$ is $I${\it-reducible} if its image in $A$ is a $k$-linear combination of length-lexicographically lesser words. An {\it obstruction} in a…

We introduce proper display calculi for intuitionistic, bi-intuitionistic and classical linear logics with exponentials, which are sound, complete, conservative, and enjoy cut-elimination and subformula property. Based on the same design,…

Universal theories are a broad class of well-motivated microscopic dynamics of the electroweak sector that go beyond the Standard Model description. The long distance physics is described by electroweak parameters which correspond to local…

From the existence of an efficient quantum algorithm for factoring, it is likely that quantum computation is intrinsically more powerful than classical computation. At present, the best upper bound known for the power of quantum computation…

Let K be a non-archimedean field, and let f in K(z) be a rational function of degree d>1. If f has potentially good reduction, we give an upper bound, depending only on d, for the minimal degree of an extension L/K such that f is conjugate…

We develop a linear-algebraic framework for dimensional analysis in systems with constraints, particularly when variables are numerous or related by implicit relations so that direct elimination is impractical. By expressing both…

We prove that if $(M,\mathcal{X})$ and $(M,\mathcal{Y})$ are countable models of the theory $\mathrm{WKL}^*_0$ such that $\mathrm{I}\Sigma_1(A)$ fails for some $A \in \mathcal{X} \cap \mathcal{Y}$, then $(M,\mathcal{X})$ and…

This paper continues the investigation begun in arXiv:1906.05602 of extending the T1 theorem of David and Journ\'e, and optimal cancellation conditions, to more general weight pairs. The main additional tool developed here is a two weight…

We study the quantitative unique continuation property of some higher order elliptic operators. In the case of $P=(-\Delta)^m$, where $m$ is a positive integer, we derive lower bounds of decay at infinity for any nontrivial solutions under…

We consider several formalizations in the language of second-order arithmetic of "The formula $\phi$ is a theorem of $\omega$-logic", including some which have been studied in the literature and a new variant defined via a least fixed…

We propose a set theory strong enough to interpret powerful type theories underlying proof assistants such as LEGO and also possibly Coq, which at the same time enables program extraction from its constructive proofs. For this purpose, we…