An approximate logic for measures

DOI10.1007/S11856-013-0054-3MaRDI QIDQ2017144zbMATH OpenOpenAlexFDO

Authors Isaac Goldbring, Henry Towsner

Publication date 25 June 2014

Published in Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1106.2854

zbMATH Keywords

ergodic theoryfirst-order logicmodel theoryFurstenberg correspondenceapproximate measure logic

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Generalized Ramsey theory (05C55) Hypergraphs (05C65) Ramsey theory (05D10) General groups of measure-preserving transformations (28D15) Applications of model theory (03C98)

Abstract: We present a logical framework for formalizing connections between finitary combinatorics and measure theory or ergodic theory that have appeared various places throughout the literature. We develop the basic syntax and semantics of this logic and give applications, showing that the method can express the classic Furstenberg correspondence and to give a short proof of the Szemer'edi Regularity Lemma. We also derive some connections between the model-theoretic notion of stability and the Gowers uniformity norms from combinatorics.

Recommendations

• A measure-theoretic approach to the theory of dense hypergraphs
• Inverting the Furstenberg correspondence
• The metamathematics of random graphs
• The stable regularity lemma revisited
• NIP, Keisler measures and combinatorics

Cites work

• scientific article; zbMATH DE number 1222940 (Why is no real title available?)
• scientific article; zbMATH DE number 722611 (Why is no real title available?)
• A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma
• A new proof of Szemerédi's theorem
• AN INVERSE THEOREM FOR THE GOWERS $U^3(G)$ NORM
• An introduction to measure theory
• An inverse theorem for the Gowers \(U^4\)-norm
• Convergence of diagonal ergodic averages
• Convergence of weighted polynomial multiple ergodic averages
• Deducing the multidimensional Szemerédi theorem from an infinitary removal lemma
• Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
• Ergodic theory and diophantine problems
• Extremal problems on set systems
• Generic structures and simple theories
• Hypergraph regularity and the multidimensional Szemerédi theorem
• Idempotents in compact semigroups and Ramsey theory
• Model theory.
• Multiple recurrence and nilsequences (with an appendix by Imre Ruzsa)
• Nonconventional ergodic averages and nilmanifolds
• Norm convergence of multiple ergodic averages for commuting transformations
• On asymptotic cones and quasi-isometry classes of fundamental groups of 3-manifolds
• Simple theories
• Stable group theory and approximate subgroups
• Szemerédi’s Regularity Lemma for Sparse Graphs
• The counting lemma for regular k‐uniform hypergraphs
• The logic of integration
• The primes contain arbitrarily long arithmetic progressions
• Weak convergence of finite graphs, integrated density of states and a Cheeger type inequality

Cited in

(13)

• Mixing and double recurrence in probability groups
• Haar measure and integral logic
• On a measure on the inductive limit of projection logics
• Logic of approximate entailment in quasimetric spaces
• scientific article; zbMATH DE number 4171720 (Why is no real title available?)
• Approximate equivalence relations
• scientific article; zbMATH DE number 1107769 (Why is no real title available?)
• Inverting the Furstenberg correspondence
• σ-algebras for quasirandom hypergraphs
• Concerning Keisler measures over ultraproducts
• An analytic approach to sparse hypergraphs: hypergraph removal
• On pseudo-finite dimensions
• Proof mining and effective bounds in differential polynomial rings

This page was built for publication: An approximate logic for measures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2017144)