Ramsey quantifiers are a natural object of study not only for logic and computer science, but also for the formal semantics of natural language. Restricting attention to finite models leads to the natural question whether all Ramsey quantifiers are either polynomial-time computable or NP-hard, and whether we can give a natural characterization of the polynomial-time computable quantifiers. In t...

The paper gives a survey of known results related to computational devices (finite and push–down automata) recognizing monadic generalized quantifiers in finite models. Some of these results are simple reinterpretations of descriptive—feasible correspondence theorems from finite–model theory. Additionally a new result characterizing monadic quantifiers recognized by push down automata is proven...

In the thesis computational semantics for monadic quantifiers in natural language in the spirit of J. van Benthem’s works [van Benthem 1986] is considered. The possible correlations between quantifiers and procedures which can be used to compute quantifiers’ denotations in finite models are discussed. We prove M. Mostowski’s theorem that monadic quantifiers definable in the divisibility logic a...

UNLABELLED We compared the processing of natural language quantifiers in a group of patients with schizophrenia and a healthy control group. In both groups, the difficulty of the quantifiers was consistent with computational predictions, and patients with schizophrenia took more time to solve the problems. However, they were significantly less accurate only with proportional quantifiers, like m...

Quantifiers are terms of generality. They are also among our prime examples of operators which take scope. The distinction between singular and general terms, as well as the ways that general terms enter into scope relations, are certainly fundamental to our understanding of language. Yet when we turn to natural language, we encounter a huge and apparently messy collection of general terms; not...

We characterize the generalized quantifiers Q which satisfy the scheme QxQyφ ↔ QyQxφ, the so-called self-commuting quantifiers, or quantifiers with the Fubini property.