An approximate logic for measures

DOI10.1007/S11856-013-0054-3zbMATH Open1298.03100arXiv1106.2854OpenAlexW2070321554MaRDI QIDQ2017144FDOQ2017144

Henry Towsner, Isaac Goldbring

Publication date: 25 June 2014

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

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.

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

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

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)

Cites Work

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

Cited In (13)

• Haar measure and integral logic
• On a measure on the inductive limit of projection logics
• Logic of approximate entailment in quasimetric spaces
• Title not available (Why is that?)
• Approximate equivalence relations
• Title not available (Why is that?)
• 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
• Mixing and double recurrence in probability groups

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)