- Submit
-
Browse
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- More
Switch to: References
Citations of:
D. Westerstå hl. Quantifiers in formal and natural languages
In J. F. A. K. Van Benthem, Johan van Benthem & Alice G. B. Ter Meulen (eds.), Handbook of Logic and Language. Elsevier. pp. 837--893 (1997)
Add citations
You must login to add citations.
|
|
|
We consider connections between number sense—the ability to judge number—and the interpretation of natural language quantifiers. In particular, we present empirical evidence concerning the neuroanatomical underpinnings of number sense and quantifier interpretation. We show, further, that impairment of number sense in patients can result in the impairment of the ability to interpret sentences containing quantifiers. This result demonstrates that number sense supports some aspects of the language faculty. |
|
|
The notion of anaphoric conservativity, that is a property of specific functions taking sets and binary relations as arguments is studied. Such functions are denotations of anaphoric determiners forming nominal anaphors. It is shown that anaphoric conservativity is strictly stronger that ordinary conservativity of this type of functions. In consequence some novel semantic descriptions of reflexive and reciprocal pronouns are provided and a semantic universal stating that reflexive and reciprocal non-possessive determiners denote anaphorically conservative functions is proposed. |
|
|
This paper argues for the thesis that, roughly put, it is impossible to talk about absolutely everything. To put the thesis more precisely, there is a particular sense in which, as a matter of semantics, quantifiers always range over domains that are in principle extensible, and so cannot count as really being ‘absolutely everything’. The paper presents an argument for this thesis, and considers some important objections to the argument and to the formulation of the thesis. The paper also offers (...) |
|
|
Several authors proposed to devise logical structures for Natural Language (NL) semantics in which noun phrases yield referential terms rather than standard Generalized Quantifiers. In this view, two main problems arise: the need to refer to the maximal sets of entities involved in the predications and the need to cope with Independent Set (IS) readings, where two or more sets of entities are introduced in parallel. The article illustrates these problems and their consequences, then presents an extension of the proposal (...) |
|
|
We are very grateful to our critics for their kind words and thoughtful engagementwith The Reference Book (hereafter TRB), and also to the editors of Mind & Language for the opportunity to respond. We’ll start our reply by sketching the book’s positive thesis about specific noun phrases and names. In §2 we’ll relate the traditional semantic category we call ‘reference’ to semantic taxonomies given in terms of mechanisms of denotation. In §3, we’ll turn to acquaintance constraints on reference and singular (...) |
|
|
This article proposes a new logical framework for NL quantification. The framework is based on Generalized Quantifiers, Skolem-like functional dependencies, and Maximality of the involved sets of entities. Among the readings available for NL sentences, those where two or more sets of entities are independent of one another are particularly challenging. In the literature, examples of those readings are known as Collective and Cumulative readings. This article briefly analyzes previous approaches to Cumulativity and Collectivity, and indicates (Schwarzschild in Pluralities. Kluwer, (...) |
|
|
Generalized quantifiers are functions from pairs of properties to truth-values; these functions can be used to interpret natural language quantifiers. The space of such functions is vast and a great deal of research has sought to find natural constraints on the functions that interpret determiners and create quantifiers. These constraints have demonstrated that quantifiers rest on number and number sense. In the first part of the paper, we turn to developing this argument. In the remainder, we report on work in (...) |
|
|
The central aim of this paper is to present a Boolean algebraic approach to the classical Aristotelian Relations of Opposition, namely Contradiction and (Sub)contrariety, and to provide a 3D visualisation of those relations based on the geometrical properties of Platonic and Archimedean solids. In the first part we start from the standard Generalized Quantifier analysis of expressions for comparative quantification to build the Comparative Quantifier Algebra CQA. The underlying scalar structure allows us to define the Aristotelian relations in Boolean terms (...) |
|
|
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. |
|
|
We provide necessary and sufficient conditions determining how monotonicity of some classes of reducible quantifiers depends on the monotonicity of simpler quantifiers of iterations to which they are equivalent. |
|
|
This paper argues for the thesis that, roughly put, it is impossible to talk about absolutely everything. To put the thesis more precisely, there is a particular sense in which, as a matter of semantics, quantifiers always range over domains that are in principle extensible, and so cannot count as really being ‘absolutely everything’. The paper presents an argument for this thesis, and considers some important objections to the argument and to the formulation of the thesis. The paper also offers (...) |
|
|
We study definability in terms of monotone generalized quantifiers satisfying Isomorphism Closure, Conservativity and Extension. Among the quantifiers with the latter three properties - here called CE quantifiers - one finds the interpretations of determiner phrases in natural languages. The property of monotonicity is also linguistically ubiquitous, though some determiners like an even number of are highly non-monotone. They are nevertheless definable in terms of monotone CE quantifiers: we give a necessary and sufficient condition for such definability. We further identify (...) |
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6686886f5-5pqs9 uwo