English
Related papers

Related papers: Metastable convergence and logical compactness

200 papers

We introduce the notion of uniform exactness, or uniform amenability at infinity, for discrete groups and prove it for a wide class of groups containing free groups and their limit groups. This shows a novel strong convergence phenomenon…

Group Theory · Mathematics 2026-05-01 Narutaka Ozawa

In an optimal control framework, we consider the value $V_T(x)$ of the problem starting from state $x$ with finite horizon $T$, as well as the value $V_\lambda(x)$ of the $\lambda$-discounted problem starting from $x$. We prove that uniform…

Optimization and Control · Mathematics 2010-04-26 Miquel Oliu-Barton , Guillaume Vigeral

We study a convergence criterion which generalises the notion of being monotonically decreasing, and introduce a quantitative version of this criterion, a so called metastable rate of asymptotic decreasingness. We then present a concrete…

Functional Analysis · Mathematics 2020-04-27 Thomas Powell

We prove that every uniform approximate homomorphism from a discrete amenable group into a symmetric group is uniformly close to a homomorphism into a slightly larger symmetric group. That is, amenable groups are uniformly flexibly stable…

Group Theory · Mathematics 2020-05-15 Oren Becker , Michael Chapman

This paper introduces the Theory of the Unique Latent Pattern (ULP), a formal epistemic framework that redefines the origin of apparent complexity in dynamic systems. Rather than attributing unpredictability to intrinsic randomness or…

Artificial Intelligence · Computer Science 2025-05-27 Mohamed Aly Bouke

The lambda-Pi-calculus modulo theory is a logical framework in which many type systems can be expressed as theories. We present such a theory, the theory U, where proofs of several logical systems can be expressed. Moreover, we identify a…

Logic in Computer Science · Computer Science 2023-06-22 Frédéric Blanqui , Gilles Dowek , Emilie Grienenberger , Gabriel Hondet , François Thiré

We consider vector lattices endowed with locally solid convergence structures, which are not necessarily topological. We show that such a convergence is defined by the convergence to $0$ on the positive cone. Some results on unbounded…

Functional Analysis · Mathematics 2024-03-13 Eugene Bilokopytov

Riesz representation theorem, Daniell-Stone theorem for Daniell integrals and Stone's representation theorem for probability and measure algebras are three important classical results in analysis concerning existence of measures with…

Classical Analysis and ODEs · Mathematics 2019-08-13 Alireza Mofidi

We use techniques of proof mining to extract a uniform rate of metastability (in the sense of Tao) for the strong convergence of approximants to fixed points of uniformly continuous pseudocontractive mappings in Banach spaces which are…

Functional Analysis · Mathematics 2020-01-17 Ulrich Kohlenbach , Andrei Sipos

Tao has recently proved that if $T_1,...,T_l$ are commuting, invertible, measure-preserving transformations on a dynamical system then for any $L^\infty$ functions $f_1,...,f_l$, the average $\frac{1}{N}\sum_{n=0}^{N-1}\prod_{i\leq…

Dynamical Systems · Mathematics 2016-07-15 Henry Towsner

We extend the theoretical framework of proof mining by establishing general logical metatheorems that allow for the extraction of the computational content of theorems with prima facie "non-computational" proofs from probability theory,…

Logic · Mathematics 2026-01-14 Morenikeji Neri , Nicholas Pischke

In this paper, we present a generalized effective completeness theorem for continuous logic. The primary result is that any continuous theory is satisfied in a structure which admits a presentation of the same Turing degree. It then follows…

Logic · Mathematics 2022-02-24 Caleb Camrud

Counterfactual reasoning is a foundational topic in both philosophical and logical studies \cite{Stalnaker1968-STAATO-5, Lewis1973-LEWC-2}. A pivotal component of counterfactual analysis is the concept of similarity between possible worlds…

Logic · Mathematics 2025-08-19 Marta Esteves

The uniform continuity theorem (UCT) states that every pointwise continuous real-valued function on the unit interval is uniformly continuous. In constructive mathematics, UCT is stronger than the decidable fan theorem (DFT); however, Loeb…

Logic · Mathematics 2020-04-17 Makoto Fujiwara , Tatsuji Kawai

Let G be a locally compact group, and let U be its unitary representation on a Hilbert space H. Endow the space L(H) of linear bounded operators on H with weak operator topology. We prove that if U is a measurable map from G to L(H) then it…

Functional Analysis · Mathematics 2021-05-27 Yulia Kuznetsova

This article is concerned with measure equivalence and uniform measure equivalence of locally compact, second countable groups. We show that two unimodular, locally compact, second countable groups are measure equivalent if and only if they…

Group Theory · Mathematics 2019-11-19 Juhani Koivisto , David Kyed , Sven Raum

We generalize pp elimination for modules, or more generally abelian structures, to a continuous logic environment where the abelian structure is equipped with a homomorphism to a compact (Hausdorff) group. We conclude that the continuous…

Logic · Mathematics 2021-09-10 Nicolas Chavarria Gomez , Anand Pillay

We note that Pillay's result on the stability of an algebraically closed field with a predicate for a group of Lang type implies that number uniformity follows formally from the finiteness results analogous to Faltings' Theorem.

Logic · Mathematics 2007-05-23 Thomas Scanlon

A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to…

Logic · Mathematics 2013-04-15 Vera Koponen

In Dung-style abstract argumentation, various semantics capture notions of acceptability of arguments. The admissibility semantics capture the notion that an argument can be consistently defended from any potential counterargument. Weak…

Artificial Intelligence · Computer Science 2026-05-05 Uri Andrews , Luca San Mauro , John Spoerl