Definability of Polyadic Lifts of Generalized Quantifiers

    loading  Checking for direct PDF access through Ovid


We study generalized quantifiers on finite structures. With every function f: ω → ω we associate a quantifier Qf by letting Qfx φ say “there are at least f(n) elements x satisfying φ, where n is the size of the universe.” This is the general form of what is known as a monotone quantifier of type 〈 1 〉. We study so called polyadic lifts of such quantifiers. The particular lifts we consider are Ramseyfication, branching and resumption. In each case we get exact criteria for definability of the lift in terms of simpler quantifiers.

    loading  Loading Related Articles