Hierarchies of Monadic Generalized Quantifiers
Luosto, Kerkko
J. Symbolic Logic, Tome 65 (2000) no. 1, p. 1241-1263 / Harvested from Project Euclid
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 Hartig quantifier is not definable by monadic quantifiers. The techniques rely on Ramsey theory.
Publié le : 2000-09-14
Classification:  03C80,  03C13,  05D10
@article{1183746180,
     author = {Luosto, Kerkko},
     title = {Hierarchies of Monadic Generalized Quantifiers},
     journal = {J. Symbolic Logic},
     volume = {65},
     number = {1},
     year = {2000},
     pages = { 1241-1263},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183746180}
}
Luosto, Kerkko. Hierarchies of Monadic Generalized Quantifiers. J. Symbolic Logic, Tome 65 (2000) no. 1, pp.  1241-1263. http://gdmltest.u-ga.fr/item/1183746180/