Special implications were introduced by Hájek and Kohout [Fuzzy implications and generalized quantifiers, Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 4 (1996) 225–233] in their investigations on some statistics on marginals. They have either suggested or only partially answered three important questions, especially related to special implications and residuals of t-norms. In this work we in...

All realistic Multi-Criteria Decision Making (MCDM) problems face various kinds of uncertainty. Since the evaluations of alternatives with respect to the criteria are uncertain they will be assumed to have stochastic nature. To obtain the uncertain optimism degree of the decision maker fuzzy linguistic quantifiers will be used. Then a new approach for fuzzy-stochastic modeling of MCDM problems ...

In this study, we investigated patients with focal neurodegenerative diseases to examine a formal linguistic distinction between classes of generalized quantifiers, like "some X" and "less than half of X." Our model of quantifier comprehension proposes that number knowledge is required to understand both first-order and higher-order quantifiers. The present results demonstrate that corticobasal...

Superlative quantifiers (“at least 3”, “at most 3”) and comparative quantifiers (“more than 2”, “fewer than 4”) are traditionally taken to be interdefinable: the received view is that “at least n” and “at most n” are equivalent to “more than n–1” and “fewer than n+1”, respectively. Notwithstanding the prima facie plausibility of this claim, Geurts and Nouwen (2007) argue that superlative quanti...

This is the second article on regular expression quantifiers. [4] introduced the quantifiers m to n occurrences and optional occurrence. In the sequel, the quantifiers: at least m occurrences and positive closure (at least 1 occurrence) are introduced. Notation and terminology were taken from [8], several properties of regular expressions from [7]. The notation and terminology used here are int...

Bisimulation quantifiers are a natural extension of modal logics. They preserve the bisimulation invariance of modal logic, while allowing monadic second-order expressivity. Unfortunately, it is not the case that extension by bisimulation quantifiers always preserves the decidability of a modal logic. Here we examine a general class of modal logics for which decidability is preserved under exte...

The paper presents a study examining the role of working memory in quantifier verification. We created situations similar to the span task to compare numerical quantifiers of low and high rank, parity quantifiers and proportional quantifiers. The results enrich and support the data obtained previously in [1–3] and predictions drawn from a computational model [4, 5].