Pruning processes and a new characterization of convex geometries

We provide a new characterization of convex geometries via a multivariate version of an identity that was originally proved, in a special case arising from the k -SAT problem, by Maneva, Mossel and Wainwright. We thus highlight the connection between various characterizations of convex geometries and a family of removal processes studied in the literature on random structures.