English
Related papers

Related papers: The Boolean Compactness Theorem for $\mathrm{L}_{\…

200 papers

The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…

Optimization and Control · Mathematics 2019-07-02 Thomas Kerdreux , Igor Colin , Alexandre d'Aspremont

We generalise the main theorems from the paper "The Borel cardinality of Lascar strong types" by I. Kaplan, B. Miller and P. Simon to a wider class of bounded invariant equivalence relations. We apply them to describe relationships between…

Logic · Mathematics 2016-03-14 Krzysztof Krupiński , Tomasz Rzepecki

We define and study logics in the framework of probabilistic team semantics and over metafinite structures. Our work is paralleled by the recent development of novel axiomatizable and tractable logics in team semantics that are closed under…

Logic in Computer Science · Computer Science 2021-04-12 Miika Hannula , Minna Hirvonen , Juha Kontinen

We show that the convolution of a compactly supported measure on $\mathbb{R}$ with a Gaussian measure satisfies a logarithmic Sobolev inequality (LSI). We use this result to give a new proof of a classical result in random matrix theory…

Probability · Mathematics 2014-11-07 David Zimmermann

In this paper, we study the density of subsets of nonabelian free groups using relative densities of languages. We start by proving some basic properties about the density of a language $L_1$ relative to another language $L_2$ containing…

Group Theory · Mathematics 2026-04-01 André Carvalho

A choice of first-order variables for the characteristic problem of the linearized Einstein equations is found which casts the system into manifestly well-posed form. The concept of well-posedness for characteristic problems invoked is that…

General Relativity and Quantum Cosmology · Physics 2009-11-10 Simonetta Frittelli

The monadic theory of $(\mathbb R,\le)$ with quantification restricted to Borel sets is decidable. The Boolean combinations of $F_\sigma$ sets form an elementary substructure of the Borel sets. Under determinacy hypotheses, the proof…

Logic · Mathematics 2026-03-10 Sven Manthe

This is the second combinatorial proof of the compactness theorem for singular from 1977. In fact it gives a somewhat stronger theorem.

Logic · Mathematics 2019-01-29 Saharon Shelah

We establish a strong law of large numbers and a central limit theorem in the Bures-Wasserstein space of covariance operators -- or equivalently centred Gaussian measures -- over a general separable Hilbert space. Specifically, we show that…

Probability · Mathematics 2024-11-05 Leonardo V. Santoro , Victor M. Panaretos

In a previous paper, we provided some update in the treatment of the finiteness theorem for rational maps of finite degree from a fixed variety to varieties of general type. In the present paper we present another improvement, introducing…

Algebraic Geometry · Mathematics 2012-03-13 Lucio Guerra , Gian Pietro Pirola

Given a weakly compact cardinal $\kappa$, we give an axiomatization of intuitionistic first-order logic over $\mathcal{L}_{\kappa^+, \kappa}$ and prove it is sound and complete with respect to Kripke models. As a consequence we get the…

Logic · Mathematics 2020-12-29 Christian Espíndola

A uniformly continuously integrable sequence of real-valued measurable functions, defined on some probability space, is relatively compact in the $\sigma(L^1,L^\infty)$ topology. In this paper, we link such a result to weak convergence…

Functional Analysis · Mathematics 2021-08-10 Gane Samb Lo , Aladji Babacar Niang

A co-valuation is, essentially, a minimal finite cover. We introduce a logic based on co-valuations, which play the role of valuations of free variables in classical first-order logic, and show that the fundamental tools of model theory --…

Logic · Mathematics 2026-01-06 Maciej Malicki

In these notes, uniform convergence on compacta is studied on the space of functions taking values in the set of finite Borel measures. Related limit theorems, including L\'evy's continuity theorem and functional limit theorems for…

Probability · Mathematics 2026-01-13 Takahiro Hasebe , Ikkei Hotta , Takuya Murayama

We study $\varepsilon$-stability in continuous logic. We first consider stability in a model, where we obtain a definability of types result with a better approximation than that in the literature. We also prove forking symmetry for…

Logic · Mathematics 2024-11-08 Nicolas Chavarria

This paper is devoted to the study of stochastic optimization problems under the generalized smoothness assumption. By considering the unbiased gradient oracle in Stochastic Gradient Descent, we provide strategies to achieve in bounds the…

Optimization and Control · Mathematics 2025-05-26 Aleksandr Lobanov , Alexander Gasnikov

We prove a T(1) Theorem to completely characterize compactness of Calderon-Zygmund operators. The result provides sufficient and necessary conditions for the compactness of singular integral operators acting on L^p(R).

Classical Analysis and ODEs · Mathematics 2014-10-08 Paco Villarroya

In this work we use variational methods to prove results on existence and concentration of solutions to a problem in $\mathbb{R}^N$ involving the $1-$Laplacian operator. A thorough analysis on the energy functional defined in the space of…

Analysis of PDEs · Mathematics 2017-02-23 C. O. Alves , M. T. O. Pimenta

For any set $A$ of natural numbers with positive upper Banach density and any $k\geq 1$, we show the existence of an infinite set $B\subset{\mathbb N}$ and a shift $t\geq0$ such that $A-t$ contains all sums of $m$ distinct elements from $B$…

Dynamical Systems · Mathematics 2025-09-16 Bryna Kra , Joel Moreira , Florian K. Richter , Donald Robertson

We show that the first-order logical theory of the binary overlap-free words (and, more generally, the ${\alpha}$-free words for rational ${\alpha}$, $2 < {\alpha} \leq 7/3$), is decidable. As a consequence, many results previously obtained…

Formal Languages and Automata Theory · Computer Science 2022-09-08 L. Schaeffer , J. Shallit