Skip to main content

Plural Quantifications and Generalized Quantifiers

  • Conference paper
  • 752 Accesses

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 7395)

Abstract

This paper discusses two important results about expressive limitations of elementary languages due to David Kaplan, and clarifies how they relate to the expressive power of plural constructions of natural languages. Kaplan proved that such plural quantifications as the following cannot be paraphrased into elementary languages:

Most things are funny. (1)

Some critics admire only one another. (2)

The proof that (1) cannot be paraphrased into elementary languages is often taken to support the generalized quantifier approach to natural languages, and the proof that (2) cannot be so paraphrased is usually taken to mean that (2) is a second-order sentence. The paper presents an alternative interpretation: Kaplan’s results provide important steps toward clarifying the expressive power of plural constructions of natural languages vis-à-vis their singular cousins. In doing so, the paper compares and contrasts (regimented) plural languages with generalized quantifier languages, and plural logic with second-order logic.

Keywords

  • semantics
  • natural language
  • plural construction
  • plural logic
  • Geach-Kaplan sentence
  • generalized quantifier theory
  • Rescher quantifier
  • plural quantifier
  • the semantics of ‘most’

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Almog, J.: The complexity of marketplace logic. Linguistics and Philosophy 20, 545–569 (1997)

    CrossRef  Google Scholar 

  • Barwise, J., Cooper, R.: Generalized quantifiers and natural language. Linguistics and Philosophy 4, 159–219 (1981)

    CrossRef  MATH  Google Scholar 

  • Boolos, G.: To be is to be a value of a variable (or to be some values of some variables). Journal of Philosophy 81, 430–449 (1984)

    CrossRef  MathSciNet  Google Scholar 

  • Ebbinghaus, H.-D., Flum, J.: Finite Model Theory, 2nd revised edn. Springer, Berlin (1999)

    MATH  Google Scholar 

  • Fagin, R.: Finite-model theory – a personal perspective. Theoretical Computer Science 116, 3–31 (1993)

    CrossRef  MathSciNet  MATH  Google Scholar 

  • Kaplan, D.: Rescher’s plurality-quantification (Abstract). Journal of Symbolic Logic 31, 153–154 (1966)

    Google Scholar 

  • Kaplan, D.: Generalized plurality quantification (Abstract). Journal of Symbolic Logic 31, 154–155 (1966)

    Google Scholar 

  • Keenan, E.L., Stavi, J.: A semantic characterization of natural language determiners. Linguistics and Philosophy 9, 253–326 (1986)

    CrossRef  MATH  Google Scholar 

  • McKay, T.: Plural Predication. Oxford University Press, Oxford (2006)

    CrossRef  Google Scholar 

  • Mostowski, A.: On a generalization of quantifiers. Fundamenta Mathematicae 44, 12–36 (1957)

    MathSciNet  Google Scholar 

  • Quine, W.V.: Methods of Logic, 3rd edn. London, RKP (1974)

    Google Scholar 

  • Rescher, N.: Plurality-quantification (Abstract). Journal of Symbolic Logic 27, 373–374 (1962)

    MathSciNet  Google Scholar 

  • Rescher, N.: Plurality quantification revisited. Philosophical Inquiry 26, 1–6 (2004)

    Google Scholar 

  • Väänänen, J.: A Short Course on Finite Model Theory. Manuscript Based on Lectures in 1993-1994 (1994), http://www.math.helsinki.fi/logic/people/jouko.vaananen/shortcourse.pdf

  • Westerståhl, D.: Logical constants in quantifier languages. Linguistics and Philosophy 8, 387–413 (1985)

    CrossRef  MATH  Google Scholar 

  • Westerståhl, D.: Quantifiers in formal and natural languages. In: Gabbay, D., Guethner, F. (eds.) The Handbook of Philosophical Logic, vol. IV, pp. 1–131. Reidel, Dordrecht (1989)

    CrossRef  Google Scholar 

  • Yi, B.-U.: Is two a property? Journal of Philosophy 95, 163–190 (1999)

    CrossRef  Google Scholar 

  • Yi, B.-U.: Understanding the Many. Routledge, New York & London (2002)

    Google Scholar 

  • Yi, B.-U.: The logic and meaning of plurals. Part I. Journal of Philosophical Logic 34, 459–506 (2005)

    CrossRef  MATH  Google Scholar 

  • Yi, B.-U.: The logic and meaning of plurals. Part II. Journal of Philosophical Logic 35, 239–288 (2006)

    CrossRef  MATH  Google Scholar 

  • Yi, B.-U.: Is logic axiomatizable? unpublished manuscript

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yi, BU. (2012). Plural Quantifications and Generalized Quantifiers. In: de Groote, P., Nederhof, MJ. (eds) Formal Grammar. FG FG 2010 2011. Lecture Notes in Computer Science, vol 7395. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32024-8_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32024-8_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32023-1

  • Online ISBN: 978-3-642-32024-8

  • eBook Packages: Computer ScienceComputer Science (R0)