Abstract
Following Henkin’s discovery of partially-ordered (branching) quantification (POQ) with standard quantifiers in 1959, philosophers of language have attempted to extend his definition to POQ with generalized quantifiers. In this paper I propose a general definition of POQ with 1-place generalized quantifiers of the simplest kind: namely, predicative, or “cardinality” quantifiers, e.g., “most”, “few”, “finitely many”, “exactly α ”, where α is any cardinal, etc. The definition is obtained in a series of generalizations, extending the original, Henkin definition first to a general definition of monotone-increasing (M↑) POQ and then to a general definition of generalized POQ, regardless of monotonicity. The extension is based on (i) Barwise’s 1979 analysis of the basic case of M↑ POQ and (ii) my 1990 analysis of the basic case of generalized POQ. POQ is a non-compositional 1st-order structure, hence the problem of extending the definition of the basic case to a general definition is not trivial. The paper concludes with a sample of applications to natural and mathematical languages.
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”, J. Philosophical Logic 8, 47–80.
Barwise, J. and Cooper, R. 1981. “Generalized Quantifiers and Natural Language”, Linguistics and Philosophy 4, 159–219.
Enderton, H.B. 1972. A Mathematical Introduction to Logic. New York, Academic Press.
Henkin, L. 1959. “Some Remarks on Infinitely Long Formulas”, Finitistic Methods, Proc. Symposium on Foundations of Math. Warsaw, 1961, 167–183.
Hintikka, J. 1973. “Quantifiers vs. Quantification Theory”, Dialectica 27, 329–358.
Lindstöm, P. 1966. “First Order Predicate Logic with Generalized Quantifiers”, Theoria 32, 186–195.
May, R. 1989. “Interpreting Logical Form”, Linguistics and Philosophy 12, 387–435.
Mostowski, A. 1957. “On a Generalization of Quantifiers”, Fund. Mathematica 44, 12–36.
Mostowski, M. 1987. “The Relational Semantics for Branched Quantifiers”, Mathematical Logic and Its Applications.Ed. D.G. Skordev, New York, Plenum Press, 315–322.
Schein, B. 1993. Plurals and Events.Cambridge, MIT.
Sher, G. 1990a. “Ways of Branching Quantifiers”, Linguistics and Philosophy 13, 393–422. A slightly revised version appears in Sher 1991a, Ch. 5.
Sher, G. 1990b. “Two Approaches to Branching Quantification”, Conference Proceedings: Theories of Partial Information, Center for Cog. Sc., U Texas, Austin.
Sher, G. 1991a. The Bounds of Logic: A Generalized Viewpoint.Cambridge, MIT.
Sher, G. 1991b. “Towards a General Definition of Partially-Ordered (Branching) Generalized Quantifiers”, Abstract. 9th International Congress of Logic, Methodology and Philosophy of Science, Uppsala, Sweden, Vol. 3, p. 157.
Sher, G. 1994. “A General Definition of Partially-Ordered Generalized Quantification (PGQ)”, Abstract. Journal of Symbolic Logic 59, 712–713.
van Benthem, J. 1989. “Polyadic Quantifiers”, Linguistics and Philosophy 12, 437–464.
Westerståhl, D. 1987. “Branching Generalized Quantifiers and Natural Language”, Generalized Quantifiers, Ed. P. Gärdenfors. Dordrecht, D. Reidel, 269–298.
Walkoe, W.J. Jr. 1970. “Finite Partially-Ordered Quantification”, Journal of Symbolic Logic 35, 535–555.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sher, G. Partially-Ordered (Branching) Generalized Quantifiers: A General Definition. Journal of Philosophical Logic 26, 1–43 (1997). https://doi.org/10.1023/A:1017944808396
Issue Date:
DOI: https://doi.org/10.1023/A:1017944808396