A semantic constraint on binary determiners

Linguistics and Philosophy 32 (1):95-114 (2009)

Abstract
A type quantifier F is symmetric iff F ( X, X )( Y ) = F ( Y, Y )( X ). It is shown that quantifiers denoted by irreducible binary determiners in natural languages are both conservative and symmetric and not only conservative.
Keywords Binary determiners  Higher type quantifiers  Symmetry  Language universals
Categories (categorize this paper)
DOI 10.1007/s10988-009-9053-6
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 44,365
Through your library

References found in this work BETA

Boolean Semantics for Natural Language.Edward L. Keenan & Leonard M. Faltz - 1987 - Journal of Symbolic Logic 52 (2):554-555.

View all 7 references / Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Nominal Comparatives and Generalized Quantifiers.John Nerbonne - 1995 - Journal of Logic, Language and Information 4 (4):273-300.
Monotonicity and Collective Quantification.Gilad Ben-avi & Yoad Winter - 2003 - Journal of Logic, Language and Information 12 (2):127-151.
Λ-Terms, Logic, Determiners and Quantifiers.Fairouz Kamareddine - 1992 - Journal of Logic, Language and Information 1 (1):79-103.
Varieties of Indefinites.Donka F. Farkas - 2002 - SALT (Semantics and Linguistic Theory) 12:59-83.
Generalized Quantifiers, and Beyond.Hanoch Ben-Yami - 2009 - Logique Et Analyse (208):309-326.

Analytics

Added to PP index
2009-05-20

Total views
23 ( #380,939 of 2,271,718 )

Recent downloads (6 months)
1 ( #823,834 of 2,271,718 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature