Abstract
We study generalized quantifiers on finite structures.With every function \(f\) : ω → ωwe associate a quantifier Q \(_{\text{f}} \) by letting Q \(_{\text{f}} \) xϕ say “there are at least \(_{\text{f}} \) (n) elementsx satisfying ϕ, where n is the sizeof the universe.” This is the general form ofwhat is known as a monotone quantifier of type < 1 >.We study so called polyadic liftsof such quantifiers. The particular lifts we considerare Ramseyfication, branching and resumption.In each case we get exact criteria fordefinability of the lift in terms of simpler quantifiers.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Barwise, J., 1979, "On branching quantifiers in English," Journal of Philosophical Logic 8, 47–80.
Cai, J., Fürer, M., and Immerman, N., 1992, "An optimal lower bound on the number of variables for graph identification," Combinatorica 12, 389–410.
Caicedo, X., 1978, "Maximality and interpolation in abstract logic," Ph.D. Dissertation, University of Maryland.
Dawar, A., 1995, "Generalized quantifiers and logical reducibilities," Journal of Logic and Computation 5, 213–226.
Fagin, R., 1975, "Monadic generalized spectra," Zeitschrift für Mathematische Logik und Grundlagenforschung 21, 89–96.
Hella, L., 1989, "Definability hierarchies of generalized quantifiers," Annals of Pure and Applied Logic 43, 235–271.
Hella, L., 1996, "Logical hierarchies in PTIME," Information and Computation 129, 1–19.
Hella, L., Luosto, K., and Väänänen, J., 1996, "The Hierarchy Theorem for generalized quantifiers," The Journal of Symbolic Logic 61, 802–819.
Hella, L. and Sandu, G., 1995, "Partially ordered connectives and finite graphs," pp. 79–88 in Quantifiers: Logics, Models and Computation, Vol. II, M. Krynicki, M. Mostowski, and L. Szczerba, eds., Dordrecht: Kluwer.
Keenan, E.L. and Westerståhl, D., 1997, "Generalized quantifiers in linguistics and logic," pp. 837–893 in Handbook of Logic and Language, J. van Benthem and A. ter Meulen, eds., Amsterdam: Elsevier.
Kolaitis, Ph.G. and Väänänen, J., 1995, "Generalized quantifiers and pebble games on finite structures," Annals of Pure and Applied Logic 74, 23–75.
Krynicki, M., Lachlan, A., and Väänänen, J., 1984, "Vector spaces and binary quantifiers," Notre Dame Journal of Formal Logic 25, 72–78.
Lindström, P., 1966, "First order predicate logic with generalized quantifiers," Theoria 32, 186–195.
Lindström, P., 1969, "On extensions of elementary logic," Theoria 35, 1–11.
Luosto, K., 1996, "Hierarchies of monadic generalized quantifiers," Reports of the Department of Mathematics, University of Helsinki, Preprint 125.
Makowsky, J. and Pnueli, Y., "Computable quantifiers and logics over finite structures," pp. 313–357 in Quantifiers: Logics, Models and Computation, Vol. I, M. Krynicki, M. Mostowski, and L. Szczerba, eds., Dordrecht: Kluwer.
Mostowski, M., "The logic of divisibility," The Journal of Symbolic Logic, to appear.
Nurmonen, J., 1996, "On winning strategies with unary quantifiers," Journal of Logic and Computation 6, 779–798.
Väänänen, J., 1997, "Unary quantifiers on finite models," Journal of Logic, Language, and Information, this issue.
Westerståhl, D., 1989, "Quantifiers in formal and natural languages," pp. 1–131 in Handbook of Philosophical Logic, Vol. IV, D. Gabbay and F. Guenthner, eds., Dordrecht: Reidel.
Westerståhl, D., 1991, "Relativization of quantifiers in finite models," pp. 187–205 in Generalized Quantifier Theory and Applications, J. van der Does and J. van Eijck, eds., ILLC, University of Amsterdam. Also pp. 375–383 in Quantifiers, Logic and Language(same editors), Stanford: CSLI Publications, 1996.
Westerståhl, D., 1995, "Quantifiers in natural language–A survey of some recent work," pp. 359–408 in Quantifiers: Logics, Models and Computation, Vol. I, M. Krynicki, M. Mostowski, and L. Szczerba, eds., Dordrecht: Kluwer.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hella, L., Väänänen, J. & Westerståhl, D. Definability of Polyadic Lifts of Generalized Quantifiers. Journal of Logic, Language and Information 6, 305–335 (1997). https://doi.org/10.1023/A:1008215718090
Issue Date:
DOI: https://doi.org/10.1023/A:1008215718090