The semantic rules governing natural language quantifiers (e.g. "all," "some," "most") neither coincide with nor resemble the semantic rules governing the analogues of those expressions that occur in the artificial languages used by semanticists. Some semanticists, e.g. Peter Strawson, have put forth data-consistent hypotheses as to the identities of the semantic rules governing some natural-language quantifiers. But, despite their obvious merits, those hypotheses have been universally rejected. In this paper, it is shown that those hypotheses are indeed correct. Moreover, data-consistent hypotheses are put forth as to the identities of the semantic rules governing the words "most" and "many," the semantic rules governing which semanticist...
In this paper we study if semantic complexity can influence the distribution of generalized quantifi...
I provide experimental evidence that quantifier semantics is transparently associated with a canonic...
Quantified expressions in natural language generally are taken to act like quantifiers in logic, whi...
The semantic rules governing natural language quantifiers (e.g. "all," "some," "most") neither coinc...
Quantified terms are terms of generality. They are also provide some of our prime examples of the ph...
Despite wide variation among natural languages, there are linguistic properties thought to be univer...
This thesis presents experimental and computational modeling studies on the mental representations o...
Throughout early English grammars and the following linguistic literature of the 20th century, the c...
This paper surveys the common approach to quantification and generalised quantification in formal li...
This paper gives an overview of the common approach to quantification and generalised quantification...
This paper is concerned with a possible mechanism for learning the meanings of quantifiers in natura...
This paper proposes a linguistic analysis of the semantic behavior of relative quantifiers in Englis...
The semantic complexity of a quantifier can be defined as the computational complexity of the finite...
The topic of dissertation “Aspects of morphosyntactic constraints on quantification in English and P...
In this paper we describe a new quantification theory based on the Object Determination Logic(ODL). ...
In this paper we study if semantic complexity can influence the distribution of generalized quantifi...
I provide experimental evidence that quantifier semantics is transparently associated with a canonic...
Quantified expressions in natural language generally are taken to act like quantifiers in logic, whi...
The semantic rules governing natural language quantifiers (e.g. "all," "some," "most") neither coinc...
Quantified terms are terms of generality. They are also provide some of our prime examples of the ph...
Despite wide variation among natural languages, there are linguistic properties thought to be univer...
This thesis presents experimental and computational modeling studies on the mental representations o...
Throughout early English grammars and the following linguistic literature of the 20th century, the c...
This paper surveys the common approach to quantification and generalised quantification in formal li...
This paper gives an overview of the common approach to quantification and generalised quantification...
This paper is concerned with a possible mechanism for learning the meanings of quantifiers in natura...
This paper proposes a linguistic analysis of the semantic behavior of relative quantifiers in Englis...
The semantic complexity of a quantifier can be defined as the computational complexity of the finite...
The topic of dissertation “Aspects of morphosyntactic constraints on quantification in English and P...
In this paper we describe a new quantification theory based on the Object Determination Logic(ODL). ...
In this paper we study if semantic complexity can influence the distribution of generalized quantifi...
I provide experimental evidence that quantifier semantics is transparently associated with a canonic...
Quantified expressions in natural language generally are taken to act like quantifiers in logic, whi...