Related papers: A Note on Induction Schemas in Bounded Arithmetic

We establish the decidability of the $\Sigma_2$ theory of both the arithmetic and hyperarithmetic degrees in the language of uppersemilattices i.e. the language with $\leq, 0$ and $\sqcup$. This is achieved by using Kumabe-Slaman forcing -…

We consider boundedness of a certain positive dyadic operator $$ T^\sigma \colon L^p(\sigma; \ \! \ell^2) \to L^p(\omega), $$ that arose during our attempts to develop a two-weight theory for the Hilbert transform in $L^p$. Boundedness of…

In this article, we investigate the theory of weighted functions of bounded variation (BV), as introduced by Baldi [Ba01]. Depending on the theorem, we impose lower semicontinuity and/or a pointwise A1 condition on the weight. Our…

We formalize the notion of Herbrand Consistency in an appropriate way for bounded arithmetics, and show the existence of a finite fragment of ${\rm I\Delta_0}$ whose Herbrand Consistency is not provable in the thoery ${\rm I\Delta_0}$. We…

In this paper, we investigate the twisted $A_{2n}$ sector of class-S theories. Heretofore, the Coulomb branches of such theories have been poorly understood. In this, and a companion paper, we make progress in our understanding of them. In…

For an L ^2-bounded Calderon-Zygmund Operator T, and a weight w \in A_2, the norm of T on L ^2 (w) is dominated by A_2 characteristic of the weight. The recent theorem completes a line of investigation initiated by Hunt-Muckenhoupt-Wheeden…

We present a review of the homological algebra tools involved in the standard de Rham theory and their subsequent generalizations relevant for the understanding of free massless higher spin gauge structure. M-theory arguments suggest the…

In this paper, we present a typed lambda calculus ${\bf SILL}(\lambda)_{\Sigma}$, a type-theoretic version of intuitionistic linear logic with subexponentials, that is, we have many resource comonadic modalities with some interconnections…

We identify fragments of the arithmetic $S_1$ that enjoy nice closure properties and have exact characterization of their definable multifunctions. To do this, in the language of $S_1$, $L_1$, starting from the formula classes,…

In this article we present Pickands theorem and his double sum method. We follow Piterbarg's proof of this theorem. Since his proof relies on general lemmas we present a complete proof of Pickands theorem using Borell inequality and Slepian…

We describe a Schubert induction theorem, a tool for analyzing intersections on a Grassmannian over an arbitrary base ring. The key ingredient in the proof is the Geometric Littlewood-Richardson rule, described in a companion paper.…

We study subsystems of open induction which are strongly connected to methods of automated inductive theorem proving. Specifically, we consider systems obtained from restricting induction to atoms, literals, clauses, and dual clauses. We…

An exact solution for an SU(2) Yang-Mills field coupled to a scalar field is given. This solution has potentials with a linear and Coulomb part. This may have some physical importance since many phenomenological QCD studies assume a linear…

We prove that for any k greater or equal to 2, given a smooth compact k-dimensional manifold and a multiplicative k-1-gerbe on a Lie group, together with an integrable connection, there is a line bundle on the corresponding…

We give a direct proof of the local $Tb$ Theorem, in the Euclidean setting, and under the assumption of dual exponents. This Theorem provides a flexible framework for proving the boundedness of a Calder\'on-Zygmund operator, supposing the…

We formalize the proof of Reingold's Theorem that SL=L [Rei05] in the theory of bounded arithmetic VL, which corresponds to ``logspace reasoning''. As a consequence, we get that VL=VSL, where VSL is the theory of bounded arithmetic for…

Linear arithmetics are extensions of Presburger arithmetic (Pr) by one or more unary functions, each intended as multiplication by a fixed element (scalar), and containing the full induction schemes for their respective languages. In this…

We study the structure of families of theories in the language of arithmetic extended to allow these families to refer to one another and to themselves. If a theory contains schemata expressing its own truth and expressing a specific Turing…

In this paper, we prove a version of the typed B\"ohm theorem on the linear lambda calculus, which says, for any given types A and B, when two different closed terms s1 and s2 of A and any closed terms u1 and u2 of B are given, there is a…

In this article we introduce a dual of the uniform boundedness principle which does not require completeness and gives an indirect means for testing the boundedness of a set. The dual principle, although known to the analyst and despite its…