English
Related papers

Related papers: A Note on Induction Schemas in Bounded Arithmetic

200 papers

The paper presents theorems on the calculation of the index of a singular point and at the infinity of monotone type mappings. These theorems cover basic cases when the principal linear part of a mapping is degenerate. Applications of these…

Analysis of PDEs · Mathematics 2007-05-23 A. P. Kovalenok , P. P. Zabreiko

This paper accompanies a new dataset of non-linear real arithmetic problems for the SMT-LIB benchmark collection. The problems come from an automated proof procedure of Gerhold--Kauers, which is well suited for solution by SMT. The problems…

Symbolic Computation · Computer Science 2023-08-22 Ali K. Uncu , James H. Davenport , Matthew England

The validity of the Addition Theorem for algebraic entropies $\ent_L$ induced by non-discrete length functions $L$ on the category of locally $L$-finite modules over arbitrary rings is proved. Concrete examples of non-discrete length…

Rings and Algebras · Mathematics 2015-05-12 Luigi Salce , Simone Virili

Let O be the ring of S-integers in a number field k. We prove that if the group of units O^* is infinite then every matrix in $\Gamma$ = SL_2(O) is a product of at most 9 elementary matrices. This completes a long line of research in this…

Number Theory · Mathematics 2018-12-26 Aleksander V. Morgan , Andrei S. Rapinchuk , Balasubramanian Sury

There are two major generalizations of the standard ordinal analysis: One is Girard's $\Pi^1_2$-proof theory in which dilators are assigned to theories instead of ordinals. The other is Pohlers' generalized ordinal analysis with Spector…

Logic · Mathematics 2026-05-21 Hanul Jeon

I give a mini-survey of several approaches to the $A_2$ theorem, biased towards the "corona" rather than the "Bellman" side of the coin. There are two new results (a streamlined form of Lerner's local oscillation formula, and the sharpness…

Classical Analysis and ODEs · Mathematics 2012-12-18 Tuomas P. Hytönen

We resolve Stillman's conjecture for families of polynomial rings that are graded by any semigroup under mild conditions. Conversely, we show that these conditions are necessary for the existence of a Stillman bound. This has applications…

Commutative Algebra · Mathematics 2025-04-15 John Cobb , Nathaniel Gallup , John Spoerl

The generalized (1+1)-D non-linear Schrodinger (NLS) theory with particular integrable boundary conditions is considered. More precisely, two distinct types of boundary conditions, known as soliton preserving (SP) and soliton non-preserving…

High Energy Physics - Theory · Physics 2008-11-26 Anastasia Doikou , Davide Fioravanti , Francesco Ravanini

We obtain a sharp $L^2\times L^2 \to L^1$ boundedness criterion for a class of bilinear operators associated with a multiplier given by a signed sum of dyadic dilations of a given function, in terms of the $L^q$ integrability of this…

Classical Analysis and ODEs · Mathematics 2018-02-27 Loukas Grafakos , Danqing He , Lenka Slavíková

Let $\gg$ be a complex reductive Lie algebra and $\kk\subset\gg$ be any reductive in $\gg$ subalgebra. We call a $(\gg,\kk)$-module $M$ bounded if the $\kk$-multiplicities of $M$ are uniformly bounded. In this paper we initiate a general…

Representation Theory · Mathematics 2007-10-05 Ivan Penkov , Vera Serganova

The main aim of this paper is to establish several Landau-type theorems for certain bounded poly-analytic functions and reduced poly-analytic functions that generalize some previously established results.

Complex Variables · Mathematics 2025-08-28 Vasudevarao Allu , Raju Biswas , Rajib Mandal , Hiroshi Yanagihara

Let $\lambda$ denote the Liouville function. We show that for all sufficiently large integers $N$, the (non-trivial) convolution sum bound $$ \left|\sum_{1 \leq n < N} \lambda(n) \lambda(N-n)\right| < N-1 $$ holds. This (essentially)…

Number Theory · Mathematics 2024-05-03 Alexander P. Mangerel

Ordinal analysis induces a partition of $\Sigma^1_1$-definable and $\Pi^1_1$-sound theories whereby two theories are equivalent if they have the same proof-theoretic ordinal. We show that no equivalence relation $\equiv$ is finer than the…

Logic · Mathematics 2022-09-22 James Walsh

We show that the nonlinear real arithmetic theory (NRA) as defined in the SMTLIB standard is undecidable. The undecidability arises from the treatment of division by zero as an uninterpreted function, which allows encoding integer…

Logic in Computer Science · Computer Science 2026-05-27 Dejan Jovanovic

In this paper we develop cyclic proof systems for the problem of inclusion between the least sets of models of mutually recursive predicates, when the ground constraints in the inductive definitions belong to the quantifier-free fragments…

Logic in Computer Science · Computer Science 2018-05-01 Radu Iosif , Cristina Serban

We verify Shalom's conjecture for the simple real-rank-one Lie group Sp(n ,1) for any n: i.e. we show that it admits a metrically proper affine action on a Hilbert space whose linear part is a uniformly bounded representation. We provide…

Group Theory · Mathematics 2022-09-12 Shintaro Nishikawa

A theory T is tight if different deductively closed extensions of T (in the same language) cannot be bi-interpretable. Many well-studied foundational theories are tight, including PA [Visser2006], ZF, Z2, and KM [enayat2017]. In this…

Logic · Mathematics 2023-05-16 Alfredo Roque Freire , Kameryn J. Williams

We present a simple yet rigorous theory of integration that is based on two axioms rather than on a construction involving Riemann sums. With several examples we demonstrate how to set up integrals in applications of calculus without using…

Classical Analysis and ODEs · Mathematics 2008-04-22 Ray Cavalcante , Todor D. Todorov

In Part I of this article we generalize the Linearized Doubling (LD) approach, introduced in earlier work by NK, by proving a general theorem stating that if $\Sigma$ is a closed minimal surface embedded in a Riemannian three-manifold…

Differential Geometry · Mathematics 2022-12-06 Nikolaos Kapouleas , Peter McGrath

Aiming to provide weak as possible axiomatic assumptions in which one can develop basic linear algebra, we give a uniform and integral version of the short propositional proofs for the determinant identities demonstrated over $GF(2)$ in…

Computational Complexity · Computer Science 2018-11-13 Iddo Tzameret , Stephen A. Cook