Definability hierarchies of generalized quantifiers (Q1824614): Difference between revisions

The author develops a general framework for proving that a quantifier is not definable in terms of n-ary quantifiers. He shows in particular that many logics existing in the literature can express a hierarchy \(Q_ 1,Q_ 2,..\). of such irreducible quantifiers. Back-and-forth techniques are applied to study the interpolation problems of certain cardinality logics.