English
Related papers

Related papers: Metastable convergence and logical compactness

200 papers

In this paper, we consider a model of classical linear logic based on coherence spaces endowed with a notion of totality. If we restrict ourselves to total objects, each coherence space can be regarded as a uniform space and each linear map…

Logic in Computer Science · Computer Science 2017-06-05 Kei Matsumoto

A well-known result of Shalom says that lattices in SO$(n,1)$ are $\mathrm{L}^p$ measure equivalent for all $p<n-1$. His proof actually yields the following stronger statement: the natural coupling resulting from a suitable choice of…

Group Theory · Mathematics 2025-05-27 Thiebout Delabie , Juhani Koivisto , François Le Maître , Romain Tessera

We present a so-called universal convergence theorem for inexact primal-dual penalty and augmented Lagrangian methods that can be applied to a large number of such methods and reduces their convergence analysis to verification of some…

Optimization and Control · Mathematics 2025-09-10 M. V. Dolgopolik

Statistical inference for non-stationary data is hindered by the failure of classical central limit theorems (CLTs), not least because there is no fixed Gaussian limit to converge to. To resolve this, we introduce relative weak convergence,…

Statistics Theory · Mathematics 2025-10-28 Nicolai Palm , Thomas Nagler

We develop tame topology over dp-minimal structures equipped with definable uniformities satisfying certain assumptions. Our assumptions are enough to ensure that definable sets are tame: there is a good notion of dimension on definable…

Logic · Mathematics 2019-09-18 Pierre Simon , Erik Walsberg

Metric Temporal Logic (MTL) and Timed Propositional Temporal Logic (TPTL) are prominent real-time extensions of Linear Temporal Logic (LTL). In general, the satisfiability checking problem for these extensions is undecidable when both the…

Logic in Computer Science · Computer Science 2021-09-07 Shankara Narayanan Krishna , Khushraj Madnani , Manuel Mazo , Paritosh K. Pandya

We extend to singular cardinals the model-theoretical relation $\lambda \stackrel{\kappa}{\Rightarrow} \mu$ introduced in P. Lipparini, The compactness spectrum of abstract logics, large cardinals and combinatorial principles, Boll. Unione…

Logic · Mathematics 2008-05-13 Paolo Lipparini

We introduce uniform K-stability and its relationship with the coercivity property of the K-energy functional, for general polarized manifolds. Since the automorphism groups are not necessarily finite, size of the norm measuring uniformity…

Differential Geometry · Mathematics 2020-07-09 Tomoyuki Hisamoto

Several variations on the definition of a Formal Topology exist in the literature. They differ on how they express convergence, the formal property corresponding to the fact that open subsets are closed under finite intersections. We…

Logic · Mathematics 2012-11-06 Francesco Ciraulo , Maria Emilia Maietti , Giovanni Sambin

A net $(x_\gamma)_{\gamma\in\Gamma}$ in a locally solid Riesz space $(X,\tau)$ is said to be unbounded $\tau$-convergent to $x$ if $|x_\gamma-x|\wedge u\mathop{\overset{\tau}{\longrightarrow}} 0$ for all $u\in X_+$. We recall that there is…

Functional Analysis · Mathematics 2022-09-21 Kevin Abela , Emmanuel Chetcuti , Hans Weber

We introduce $p$-uniformity to characterize the scaling of density fluctuations in spatial random systems in $\mathbb{R}^d$, ranging from hyperfluctuation to stealthy hyperuniformity. Our central theorem establishes sufficient conditions to…

Probability · Mathematics 2026-05-22 Luca Lotz , Michael A. Klatt

In aiming to apply to a broader class of examples the Avigad-Iovino "ultraproducts and metastability" approach to obtaining uniformity for convergence of sequences, we construct a framework using continuous logic that in particular is able…

Logic · Mathematics 2019-01-28 Simon Cho

We define the concept of a logic frame, which extends the concept of an abstract logic by adding the concept of a syntax and an axiom system. In a recursive logic frame the syntax and the set of axioms are recursively coded. A recursive…

Logic · Mathematics 2007-05-23 Saharon Shelah , Jouko Väänänen

This paper identifies the homotopy theories of topological stacks and orbispaces with unstable global homotopy theory. At the same time, we provide a new perspective by interpreting it as the homotopy theory of `spaces with an action of the…

Algebraic Topology · Mathematics 2020-01-13 Stefan Schwede

In this paper we further study links between concentration of measure in topological transformation groups, existence of fixed points, and Ramsey-type theorems for metric spaces. We prove that whenever the group $\Iso(\U)$ of isometries of…

Functional Analysis · Mathematics 2007-09-03 Vladimir Pestov

An uninterpreted program (UP) is a program whose semantics is defined over the theory of uninterpreted functions. This is a common abstraction used in equivalence checking, compiler optimization, and program verification. While simple, the…

Logic in Computer Science · Computer Science 2021-07-28 Hari Govind V K , Sharon Shoham , Arie Gurfinkel

Propositional formulas that are equivalent in intuitionistic logic, or in its extension known as the logic of here-and-there, have the same stable models. We extend this theorem to propositional formulas with infinitely long conjunctions…

Logic in Computer Science · Computer Science 2020-02-19 Amelia Harrison , Vladimir Lifschitz , Miroslaw Truszczynski

In the nice recent work [48], S. Wang established uniform log-Sobolev inequalities for mean field particles when the energy is flat convex. In this note we comment how to extend his proof to some semi-convex energies provided the curvature…

Analysis of PDEs · Mathematics 2024-09-27 Pierre Monmarché

We show that a compact representation of a semisimple Lie group has an orthogonal decomposition into finite length representations. This generalises and simplifies a number of more special spectral theorems in the literature. We apply it to…

Number Theory · Mathematics 2024-01-30 Anton Deitmar

The $\textbf{P}$ vs. $\textbf{NP}$ problem is an important problem in contemporary mathematics and theoretical computer science. Many proofs have been proposed to this problem. This paper proposes a theoretic proof for $\textbf{P}$ vs.…

Computational Complexity · Computer Science 2020-07-02 Changlin Wan , Zhongzhi Shi