English
Related papers

Related papers: On principles between $\Sigma_1$- and $\Sigma_2$-i…

200 papers

We introduce a sequent calculus with a simple restriction of Lambek's product rules that precisely captures the classical Tamari order, i.e., the partial order on fully-bracketed words (equivalently, binary trees) induced by a…

Logic in Computer Science · Computer Science 2017-01-12 Noam Zeilberger

Higman's lemma and Kruskal's theorem are two of the most celebrated results in the theory of well quasi-orders. In his seminal paper G. Higman obtained what is known as Higman's lemma as a corollary of a more general theorem, dubbed here…

Logic · Mathematics 2026-02-06 Gabriele Buriola , Andreas Weiermann

We provide a proof that all polynomial higher-derivative effective field theories of vacuum gravity admit a well-posed initial value formulation when augmented by suitable regularising terms. These regularising terms can be obtained by…

General Relativity and Quantum Cosmology · Physics 2024-07-15 Pau Figueras , Aaron Held , Áron D. Kovács

In [8] (Nakagawa, et.al., IEEE Trans. IT, 2021), we investigated the convergence speed of the Arimoto-Blahut algorithm. In [8], the convergence of the order $O(1/N)$ was analyzed by focusing on the second-order nonlinear recurrence formula…

Information Theory · Computer Science 2022-09-13 Kenji Nakagawa , Yoshinori Takei , Shin-ichiro Hara

We consider first-order logic over the subword ordering on finite words, where each word is available as a constant. Our first result is that the $\Sigma_1$ theory is undecidable (already over two letters). We investigate the decidability…

Logic in Computer Science · Computer Science 2021-09-27 Simon Halfon , Philippe Schnoebelen , Georg Zetzsche

A well-ordering principle is a principle of the form: If $X$ is well-ordered then $F(X)$ is well-ordered, where $F$ is some natural operator transforming linear orders into linear orders. Many important subsystems of Second-order Arithmetic…

Logic · Mathematics 2025-06-12 Lorenzo Carlucci , Leonardo Mainardi , Konrad Zdanowski

Many recent studies on first-order methods (FOMs) focus on \emph{composite non-convex non-smooth} optimization with linear and/or nonlinear function constraints. Upper (or worst-case) complexity bounds have been established for these…

Optimization and Control · Mathematics 2023-07-18 Wei Liu , Qihang Lin , Yangyang Xu

We present some new ideas on important problems related to primes. The topics of our discussion are: simple formulae for primes, twin primes, Sophie Germain primes, prime tuples less than or equal to a predefined number, and their…

General Mathematics · Mathematics 2015-11-24 Dhananjay P. Mehendale

Both analytic and geometric forms of an optimal monotone principle for $L^p$-integral of the Green function of a simply-connected planar domain $\Omega$ with rectifiable simple curve as boundary are established through a sharp…

Differential Geometry · Mathematics 2009-08-11 Jie Xiao

We show that diagrammatic sets, a topologically sound alternative to polygraphs and strict $\omega$-categories, admit an internal notion of equivalence in the sense of coinductive weak invertibility. We prove that equivalences have the…

Category Theory · Mathematics 2025-12-23 Clémence Chanavat , Amar Hadzihasanovic

We analyse the Boolean-valued random forcing $B_{M,\Omega}$ in bounded arithmetics developed in Krajicek (Forcing with random variables and proof complexity, vol. 382, Cambridge University Press, 2011) from the perspective of the forcing in…

Logic · Mathematics 2026-03-12 Radek Honzik

We show that the twisted second moments of the Riemann zeta function averaged over the arithmetic progression $1/2 + i(an + b)$ with $a > 0$, $b$ real, exhibits a remarkable correspondance with the analogous continuous average and derive…

Number Theory · Mathematics 2012-08-14 Xiannan Li , Maksym Radziwill

The regular languages with a neutral letter expressible in first-order logic with one alternation are characterized. Specifically, it is shown that if an arbitrary $\Sigma_2$ formula defines a regular language with a neutral letter, then…

Logic in Computer Science · Computer Science 2022-03-14 Corentin Barloy , Michaël Cadilhac , Charles Paperman , Thomas Zeume

Koksma's equidistribution theorem from 1935 states that for Lebesgue almost every $\alpha>1$, the fractional parts of the geometric progression $(\alpha^{n})_{n\geq1}$ are equidistributed modulo one. In the present paper we sharpen this…

Number Theory · Mathematics 2020-10-21 Christoph Aistleitner , Simon Baker , Niclas Technau , Nadav Yesha

In this paper we consider perturbation theory in generic two-dimensional sigma models in the so-called first-order formalism, using the coordinate regularization approach. Our goal is to analyze the first-order formalism in application to…

High Energy Physics - Theory · Physics 2023-11-22 Oleksandr Gamayun , Andrei Losev , Mikhail Shifman

This note deals with a problem of the probabilistic Ramsey theory in functional analysis. Given a linear operator $T$ on a Hilbert space with an orthogonal basis, we define the isomorphic structure $\Sigma(T)$ as the family of all subsets…

Functional Analysis · Mathematics 2016-12-23 Roman Vershynin

We show that the iterates generated by a generic first-order meta-algorithm satisfy a canonical perturbed Fenchel duality inequality. The latter in turn readily yields a unified derivation of the best known convergence rates for various…

Optimization and Control · Mathematics 2021-12-06 David H. Gutman , Javier F. Peña

Given an anisotropic integrand $F:\text{Gr}_k(\mathbb R^n)\to(0,\infty)$, we can generalize the classical isotropic area by looking at the functional $$\mathcal{F}(\Sigma^k):=\int_\Sigma F(T_x\Sigma)\,d\mathcal{H}^k.$$ While a monotonicity…

Analysis of PDEs · Mathematics 2026-03-20 Guido De Philippis , Alessandro Pigati

We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.

Logic · Mathematics 2020-03-12 Lars Kristiansen , Juvenal Murwanashyaka

We will find a lower bound on the recognition complexity of the theories that are nontrivial relative to some equivalence relation (this relation may be equality), namely, each of these theories is consistent with the formula, whose sense…

Logic · Mathematics 2023-10-16 Ivan V. Latkin