An approximate logic for measures

We present a logical framework for formalizing connections between finitary combinatorics and measure theory or ergodic theory that have appeared in 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 short proofs of the Szemer,di Regularity Lemma and the hypergraph removal lemma. We also derive some connections between the modeltheoretic notion of stability and the Gowers uniformity norms from combinatorics.