相关论文: Metastable convergence and logical compactness

We extend to binary relational systems the notion of compact and normal structure, introduced by J.P.Penot for metric spaces, and we prove that for the involutive and reflexive ones, every commuting family of relational homomorphisms has a…

We define an easily verifiable notion of an atomic formula having uniformly bounded arrays in a structure $M$. We prove that if $T$ is a complete $L$-theory, then $T$ is mutually algebraic if and only if there is some model $M$ of $T$ for…

We prove that given a computable metric space and two computable measures, the set of points that have high universal uniform test scores with respect to the first measure will have a lower bound with respect to the second measure. This…

Let G be a locally compact abelian group (LCA group) and U be an open, 0-symmetric set. Let F:=F(U) be the set of all real valued continuous functions from G to R which are supported in U and are positive definite. The Turan constant T(U)…

Von Neumann's original proof of the ergodic theorem is revisited. A uniform convergence rate is established under the assumption that one can control the density of the spectrum of the underlying self-adjoint operator when restricted to…

This paper generalizes sofic entropy theory, in both the topological and measure-theory settings, to actions of locally compact groups. We prove invariance under topological and measure conjugacy of these entropies and establish the…

Propositional Typicality Logic (PTL) is a recently proposed logic, obtained by enriching classical propositional logic with a typicality operator capturing the most typical (alias normal or conventional) situations in which a given sentence…

Let E be a Dedekind complete Riesz space with weak unit e, equipped with a conditional expectation operator T. We prove that the spaces Lp(T), with their natural vector-valued norms, are strongly complete, extending the p=2 case of Kuo,…

Out of the recent advances in systems and control (S\&C)-based analysis of optimization algorithms, not enough work has been specifically dedicated to machine learning (ML) algorithms and its applications. This paper addresses this gap by…

We use techniques of proof mining to obtain a computable and uniform rate of metastability (in the sense of Tao) for the mean ergodic theorem for a finite number of commuting linear contractive operators on a uniformly convex Banach space.

Let $(P,\leq)$ be a partially ordered set and let $\tau$ be a compact topology on $P$ that is finer than the interval topology. Then $\tau$ is contained in the order (convergence) topology on $(P,\tau)$. So any Priestley topology is…

State convergence is essential in several scientific areas, e.g. multi-agent consensus/disagreement, distributed optimization, monotone game theory, multi-agent learning over time-varying networks. This paper is the first on state…

We show how to use topological ideas, such as compactness, to establish orderability properties of infinite groups. A new application is to provide a left-ordering for the group of PL homeomorphisms of a connected surface with boundary…

In this paper we study the global structure of the stable homotopy theory of spectra. We establish criteria for when the homotopy theory associated to a given stable model category agrees with the classical stable homotopy theory of…

In much discussed work Artemov has recently shown that, for $\mathrm{PA}$, the consistency schema admits a form of uniform verification via selector proofs, despite the unprovability of the corresponding uniform consistency sentence…

We prove non-convergence theorems towards an unstable equilibrium (or a trap) for stochastic processes. The processes we consider are continuous-time or discrete-time processes and can be pertubations of the flow generated by a vector…

We characterize conditions under which collections of distributions on $\{0,1\}^\mathbb{N}$ admit uniform estimation of their mean. Prior work from Vapnik and Chervonenkis (1971) has focused on uniform convergence using the empirical mean…

The consensus problem, briefly stated, consists of having processes in an asynchronous distributed system agree on a value. It is widely known that the consensus problem does not have a deterministic solution that ensures both termination…

Logical paradoxes and inconsistent information pose deep challenges in epistemology and the philosophy of logic. Classical systems typically handle contradictions only through external checks or by altering the logical framework, as in…

A proof of the continuous martingale convergence theorem is provided. It relies on a classical martingale inequality and the almost sure convergence of a uniformly bounded non-negative super-martingale, after a truncation argument.