Related papers: An approximate logic for measures
The trivial proof of the ergodic theorem for a finite set $Y$ and a permutation $T:Y\to Y$ shows that for an arbitrary function $f:Y\to{\mathbb R}$ the sequence of ergodic means $A_n(f,T)$ stabilizes for $n \gg |T|$. We show that if $|Y|$…
Goedel's completeness theorem is concerned with provability, while Girard's theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proofs. Our purpose is to look for a connection between these two…
We develop a classical propositional logic for reasoning about combinatory logic. We define its syntax, axiomatic system and semantics. The syntax and axiomatic system are presented based on classical propositional logic, with typed…
The intuitive notion of evidence has both semantic and syntactic features. In this paper, we develop an {\em evidence logic} for epistemic agents faced with possibly contradictory evidence from different sources. The logic is based on a…
The Furstenberg recurrence theorem (or equivalently, Szemer\'edi's theorem) can be formulated in the language of von Neumann algebras as follows: given an integer $k \geq 2$, an abelian finite von Neumann algebra $(\M,\tau)$ with an…
We discuss the Dempster-Shafer theory of evidence. We introduce a concept of monotonicity which is related to the diminution of the range between belief and plausibility. We show that the accumulation of knowledge in this framework exhibits…
Building upon the theory of graph limits and the Aldous-Hoover representation and inspired by Panchenko's work on asymptotic Gibbs measures (Annals of Probability 2013), we construct continuous embeddings of discrete probability…
An extension of Szemer\'edi's Theorem is proved for sets of positive density in approximate lattices in general locally compact and second countable abelian groups. As a consequence, we establish a recent conjecture of Klick, Strungaru and…
We formalise the self-referential definition of physical laws using monotone operators on a lattice of theories, resolving the pathologies of naive set-theoretic formulations. By invoking Tarski fixed point theorem, we identify physical…
We offer a new proof of the Furstenberg-Katznelson multiple recurrence theorem for several commuting probability-preserving transformations T_1, T_2, >..., T_d: \bbZ\curvearrowright (X,\S,\mu), and so, via the Furstenberg correspondence…
In this paper, a polynomial version of Furstenberg joining is introduced and its structure is investigated. Particularly, it is shown that if all polynomials are non-linear, then almost every ergodic component of the joining is a direct…
We study an intermittent quasistatic dynamical system composed of nonuniformly hyperbolic Pomeau--Manneville maps with time-dependent parameters. We prove an ergodic theorem which shows almost sure convergence of time averages in a certain…
In graph theory, the Szemer\'edi regularity lemma gives a decomposition of the indicator function for any graph $G$ into a structured component, a uniform part, and a small error. This result, in conjunction with a counting lemma that…
For the pants graph, there is little known about the behaviour of geodesics, as opposed to quasigeodesics. Brock-Masur-Minsky showed that geodesics or geodesic segments connecting endpoints satisfying a bounded combinatorics condition, such…
We prove structural results for measure preserving systems, called Furstenberg systems, naturally associated with bounded multiplicative functions. We show that for all pretentious multiplicative functions these systems always have rational…
We survey some of the ideas behind the recent developments in additive number theory, combinatorics and ergodic theory leading to the proof of Hardy- Littlewood type estimates for the number of prime solutions to systems of linear equations…
In this paper, we prove coincidence and common fixed points results under nonlinear contractions on a metric space equipped with an arbitrary binary relation. Our results extend, generalize, modify and unify several known results especially…
This paper addresses fundamental issues on the nature of the concepts and structures of fuzzy logic, focusing, in particular, on the conceptual and functional differences that exist between probabilistic and possibilistic approaches. A…
We apply the methods of ergodic theory to both simplify and significantly extend some classical results due to Stewart, Tijdeman, and Ruzsa. One of the notable features of our approach is the utilization of pointwise ergodic theory.
We propose FC, a new logic on words that combines finite model theory with the theory of concatenation - a first-order logic that is based on word equations. Like the theory of concatenation, FC is built around word equations; in contrast…