Skip to main content

Generalising Predicate and Argument Invariance

  • Conference paper
Logical Aspects of Computational Linguistics (LACL 2014)

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

Abstract

Some constraints on higher order functions (maps from relations (or from sets and relations) to sets of type 〈1〉 quantifiers are studied. Such functions are denoted by ”higher order” anaphors and comparatives. The constraints studied here are generalisations of similar constraints holding for ”simple” functions from relations to sets denoted by ”simple” anaphors and comparatives. Simple functions satisfy either predicate invariance or argument invariance. I propose a generalisation of these constraints. This generalisation makes it possible to spell out more formally differences and similarities between ”simple” anaphors like himself and ”higher order” anaphors like each other on the one hand, and between simple comparatives (like the greatest number of books) and ”higher order” comparatives (like the same books) on the other.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  MATH  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.: On the denotations of anaphors. Research on Language and Computation, 5-1–5-17 (2007)

    Google Scholar 

  • Keenan, E. L.: In Situ Interpretation without Type Mismatches. Forthcoming in A. Bianchi, (ed.) On Referring, OUP 2014 (2014)

    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 

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

    Article  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 (2011a)

    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 (2011)

    Chapter  Google Scholar 

  • Zuber, R.: Some higher order functions on binary relations. In: Morrill, G., Nederhof, M.-J. (eds.) FG 2012/2013. LNCS, vol. 8036, pp. 277–291. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zuber, R. (2014). Generalising Predicate and Argument Invariance. In: Asher, N., Soloviev, S. (eds) Logical Aspects of Computational Linguistics. LACL 2014. Lecture Notes in Computer Science, vol 8535. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43742-1_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-43742-1_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-43741-4

  • Online ISBN: 978-3-662-43742-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics