Skip to main content

Some Higher Order Functions on Binary Relations

  • Conference paper

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

Abstract

Some higher order functions needed in linguistic semantics are studied. Such functions take binary relations or sets and binary relations as arguments and give sets of type 〈1 〉 quantifiers as output. Formal constraints on such functions are generalisations of similar constraints holding for generalised quantifiers and “simple” functions on binary relations. Some theorems concerning such constraints, in particular (generalised) conservativity and cardinality, are proved and some relationships with (Frege) irreducible quantifiers are indicated.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • 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

  • Beck, S.: Exceptions in Relational Plurals. In: Jackson, B., Matthews, T. (eds.) SALT X, pp. 1–16. Cornell University (2000)

    Google Scholar 

  • Dalrymple, M., et al.: Reciprocal expressions and the concept of reciprocity. Linguistics and Philosophy 21, 159–210 (1998)

    Article  Google Scholar 

  • Keenan, E.L.: Semantic Case Theory. In: Groenendijk, J., Stokhof, M. (eds.) Proc. of the Sixth Amsterdam Colloquium (1987)

    Google Scholar 

  • Keenan, E.L.: Beyond the Frege boundary. Linguistics and Philosophy 15, 199–221 (1992)

    Article  MATH  Google Scholar 

  • Keenan, E.L.: On the denotations of anaphors. Research on Language and Computation 5(1), 5–17 (2007)

    Article  Google Scholar 

  • Keenan, E.L., Westerståhl, D.: Generalized Quantifiers in Linguistics and Logic. In: van Benthem, J., ter Meulen, A. (eds.) Handbook of Logic and Language, pp. 837–893. Elsevier, Amsterdam (1997)

    Chapter  Google Scholar 

  • van Eijck, J.: Normal Forms for Characteristic Functions. Journal of Logic and Computation 15(2), 85–98 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  • Westerståhl, D.: Self-commuting quantifiers. The Journal of Symbolic Logic 61(1), 212–224 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  • Zuber, R.: Indépendance faible des quantificateurs. Logique et Analyse 198, 173–178 (2007)

    MathSciNet  Google Scholar 

  • Zuber, R.: Generalising Conservativity. In: Dawar, A., de Queiroz, R. (eds.) WoLLIC 2010. LNCS (LNAI), vol. 6188, pp. 247–258. Springer, Heidelberg (2010a)

    Chapter  Google Scholar 

  • Zuber, R.: Semantic Constraints on Anaphoric Determiners. Research on Language and Computation 8, 255–271 (2010b)

    Article  Google Scholar 

  • Zuber, R.: Some generalised comparative determiners. In: Pogodalla, S., Prost, J.-P. (eds.) LACL 2011. LNCS, vol. 6736, pp. 267–281. Springer, Heidelberg (2011a)

    Google Scholar 

  • Zuber, R.: Generalised Quantifiers and the Semantics of the same. In: Ashton, N., et al. (eds.) Proceedings of SALT 21, e-Language, pp. 515–531 (2011b)

    Google Scholar 

  • Zuber, R.: Reciprocals as higher order functions. In: Proceedings of the Ninth International Workshop of Logic and Engineering of Natural Language Semantics 9 (LENLS 9), pp. 118–129 (2012a)

    Google Scholar 

  • Zuber, R.: Reflexives and non-Fregean quantifiers. In: Graf, T., et al. (eds.) Theories of Everything: in Honor of Ed Keenan, UCLA Working Papers in Linguistics, vol. 17, pp. 439–445 (2012b)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zuber, R. (2013). Some Higher Order Functions on Binary Relations. In: Morrill, G., Nederhof, MJ. (eds) Formal Grammar. FG FG 2013 2012. Lecture Notes in Computer Science, vol 8036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39998-5_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39998-5_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39997-8

  • Online ISBN: 978-3-642-39998-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics