Hierarchies of monadic generalized quantifiers

Kerkko Luosto

Journal of Symbolic Logic · 2000 · 33 citations · 7 references

Concepts

Abstract

Abstract A combinatorial criterium is given when a monadic quantifier is expressible by means of universe-independent monadic quantifiers of width n . It is proved that the corresponding hierarchy does not collapse. As an application, it is shown that the second resumption (or vectorization) of the Härtig quantifier is not definable by monadic quantifiers. The techniques rely on Ramsey theory.

References

7