On probabilistic elimination of generalized quantifiers
Risto Kaila · Random Structures and Algorithms · 2001
Abstract Let 𝒬 be a collection of generalized quantifiers. We give a convenient characterization for the cases where the logic ℒ︁ (𝒬) has quantifier elimination for an arbitrary class of structures. The results provide a method to prove zero‐one and convergence laws for such logics with arbitrary sequences of probability measures of finite structures. © 2001 John Wiley & Sons, Inc. Random Struct. Alg., 19, 1–36, 2001