Skip to main content
Log in

Unary Quantifiers on Finite Models

  • Published:
Journal of Logic, Language and Information Aims and scope Submit manuscript

Abstract

In this paper (except in Section 5) all quantifiers are assumedto be so called simple unaryquantifiers, and all models are assumedto be finite. We give a necessary and sufficientcondition for a quantifier to be definablein terms of monotone quantifiers. For amonotone quantifier we give a necessaryand sufficient condition for beingdefinable in terms of a given set of bounded monotonequantifiers. Finally, we give a necessaryand sufficient condition for a monotonequantifier to be definable in terms of agiven monotone quantifier.Our analysis shows that the quantifier’’at least one half” and its relatives behavedifferently than other monotone quantifiers.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • van Benthem, J., 1984, "Questions about quantifiers," Journal of Symbolic Logic 49, 443–466.

    Google Scholar 

  • Corredor, L.J., 1986, "El reticulo de las logicas de primer orden con cuantificadores cardinales," Revista Colombiana de Mathemáticas 20, 1–26.

    Google Scholar 

  • Hájek, P., 1977, "Generalized quantifiers and finite sets," pp. 91–104 in Prace Nauk. Inst. Mat. Politech. Wroclaw No. 14 Ser. Konfer. No. 1.

  • Hella, L., 1996, "Logical hierarchies in PTIME," Information and Computation 129, 1–19.

    Google Scholar 

  • Hella, L., Väänänen, J., and Westerståhl, D., 1997, "Definability of polyadic lifts of generalized quantifiers," Journal of Logic, Language and Information, this issue.

  • 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.

    Google Scholar 

  • Lindström, P., 1966, "First order predicate logic with generalized quantifiers," Theoria 32, 186–195.

    Google Scholar 

  • Luosto, K., 1996, "Hierarchies of monadic generalized quantifiers," Reports of the Department of Mathematics, University of Helsinki, Preprint 125.

  • Mostowski, A., 1996, "On a generalization of quantifiers," Fundamenta Mathematicae 44, 12–36.

    Google Scholar 

  • 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: D. Reidel.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Väänänen, J. Unary Quantifiers on Finite Models. Journal of Logic, Language and Information 6, 275–304 (1997). https://doi.org/10.1023/A:1008209019899

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008209019899

Navigation