generalized quantifier (original) (raw)

The underlying principle is that formulas quantified by a generalized quantifier are true if the set of elements satisfying those formulas belong in some relation associated with the quantifier.

Every generalized quantifier has an arity, which is the number of formulas it takes as arguments, and a type, which for an n-ary quantifier is a tuple of length n. The tuple represents the number of quantified variables for each argument.

The most common quantifiers are those of type ⟨1⟩, including ∀ and ∃. If Q is a quantifier of type ⟨1⟩, M is the universe of a model, and QM is the relation associated with Q in that model, then Q⁢x⁢ϕ⁢(x)↔{x∈M∣ϕ⁢(x)}∈QM.

So ∀M={M}, since the quantified formula is only true when all elements satisfy it. On the other hand ∃M=P⁢(M)-{∅}.

In general, the monadic quantifiers are those of type ⟨1,…,1⟩ and if Q is an n-ary monadic quantifier then QM⊆P⁢(M)n. Härtig’s quantifier, for instance, is ⟨1,1⟩, and IM={⟨X,Y⟩∣X,Y⊆M∧|X|=|Y|}.

A quantifier Q is polyadic if it is of type ⟨n1,…,nn⟩ where each ni∈ℕ. Then:

These can get quite elaborate; W⁢x⁢y⁢ϕ⁢(x,y) is a ⟨2⟩ quantifier where X∈WM↔X is a well-ordering. That is, it is true if the set of pairs making ϕ true is a well-ordering.