Titlebook: Quantifiers and Cognition: Logical and Computational Perspectives; Jakub Szymanik Book 2016 Springer International Publishing Switzerland

不来

Anecdote

Complexity of Quantified Reciprocalssions, like ‘each other’ in English. I show that Ramsey quantifiers express the semantics of reciprocal sentences with a quantifier in the antecedent. As a result I find a computational dichotomy between different interpretations of reciprocals: some of them are tractable when others are intractable

DAMN

Branching Quantifiersare intractable, and therefore, their occurrence in natural language is far from obvious. I start by discussing the thesis formulated by Hintikka, which says that certain natural language sentences require nonlinear quantification to express their meaning. Then, I discuss a novel alternative reading

慎重

万灵丹

Complexity in Linguisticsder logic (belongs to NP). Finally, I discuss, very common in formal semantics, restriction to finite interpretations. This chapter gives, therefore, an additional argument for studying the computational complexity of natural language expressions.

柔声地说

Standard Polyadic Liftstification. I recall classic characterization results of the Frege boundary and ask about its place in Chomsky’s hierarchy. While doing this I emphasize the role of computational/cognitive representations in the formal semantics of natural language.

倒转

Complexity of Collective Quantifications no second-order definable lift expressing the collective meaning of the quantifier ‘most’. This is clearly a restriction of the type-shifting approach. I finish by discussing various methodological interpretation of this result, touching again upon the issues of complexity in natural language and the semantic borders of everyday language.

无能性

Erratum to: Quantifiers and Cognition: Logical and Computational Perspectives,

misanthrope

独轮车