Monotonicity and Processing Load
Journal of Semantics 22 (1):97-117 (2005)
| Abstract | Starting out from the assumption that monotonicity plays a central role in interpretation and inference, we derive a number of predictions about the complexity of processing quantified sentences. A quantifier may be upward entailing (i.e. license inferences from subsets to supersets) or downward entailing (i.e. license inferences from supersets to subsets). Our main predictions are the following: If the monotonicity profiles of two quantifying expressions are the same, they should be equally easy or hard to process, ceteris paribus. Sentences containing both upward and downward entailing quantifiers are more difficult than sentences with upward entailing quantifiers only. Downward-entailing quantifiers built from cardinals, like ‘at most three’, are more difficult than others. Inferences from subsets to supersets are easier than inferences in the opposite direction. We present experimental evidence confirming these predictions | |||||||||
| Keywords | bibtex-import generalized quantifiers | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,664 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesJouko Väänänen & Dag Westerståhl (2002). On the Expressive Power of Monotone Natural Language Quantifiers Over Finite Models. Journal of Philosophical Logic 31 (4):327-358.
Heribert Vollmer (1999). A Generalized Quantifier Concept in Computational Complexity Theory. In Generalized Quantifiers and Computation (Aix-En-Provence, 1997). Springer.
R. Zuber (2010). A Note on the Monotonicity of Reducible Quantifiers. Journal of Logic, Language and Information 19 (1).
M. Krynicki & M. Mostowski (1995). Henkin Quantifiers. In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers.
M. Mostowski (1995). Quantifiers Definable by Second Order Means. In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers.
M. Krynicki & M. Mostowski (1995). Quantifiers, Some Problems and Ideas. In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers.
Makoto Kanazawa (1994). Weak Vs. Strong Readings of Donkey Sentences and Monotonicity Inference in a Dynamic Setting. Linguistics and Philosophy 17 (2):109 - 158.
K. Luosto (1999). Ramsey Theory is Needed for Solving Definability Problems of Generalized Quantifiers. 1754:121--134.
C. T. Mcmillan, R. Clark, P. Moore, C. Devita & M. Grossman (2005). Neural Basis for Generalized Quantifiers Comprehension. Neuropsychologia 43:1729--1737.
Per Lindström (1966). First Order Predicate Logic with Generalized Quantifiers. Theoria 32:186--195.
J. Makowsky & Y. Pnueli (1995). Computable Quantifiers and Logics Over Finite Structures. In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers.
M. Krynicki & M. Mostowski (1999). Ambigous Quantifiers. In E. Orłowska (ed.), Logic at Work. Heidelberg.
Gilad B. Avi & Yoad Winter (2003). Monotonicity and Collective Quantification. Journal of Logic, Language and Information 12 (2):127--151.
Jaakko Hintikka (1974). Quantifiers Vs. Quantificational Theory. Linguistic Inquiry 5:153--77.
Analytics
Monthly downloads |
Added to index2010-09-02Total downloads3 ( #201,781 of 549,010 )Recent downloads (6 months)1 ( #63,261 of 549,010 )How can I increase my downloads? |
My notes
Discussion
