This paper investigates the behaviour of binary quantifiers in settings of incomplete information, i.e., in partial models. The framework to handle informational partiality that is presented in this paper is relevant for the behaviour of quantifiers in the natural language semantics of propositional attitudes and perception reports, for theories of vagueness in natural language and for semantic accounts of natural language fragments containing a truth predicate. First, the constraints on binary relations on a universe that make these relations qualify for the honorific title quantificational are generalized to the partial case. Special consideration is given to quantifiers defined via supervaluation from quantifiers on total models. Next, p...
PART I (Partial-valued Languages): In Chapter I we consider modes of sentence composition and ask wh...
Abstract: In Generalized Quantifier Semantics for Natural Language, as developed by Montague, Barwis...
Quantified expressions in natural language generally are taken to act like quantifiers in logic, whi...
Recent work in generalized quantifier theory has greatly increased our understanding of the types of...
This thesis presents experimental and computational modeling studies on the mental representations o...
Quantified terms are terms of generality. They are also provide some of our prime examples of the ph...
I here argue that Ted Sider's indeterminacy argument against vagueness in quantifiers fails. Sider c...
ing from the domain of discourse, we can say that determiner interpretations (henceforth: determiner...
I here argue that Ted Sider's indeterminacy argument against vagueness in quantifiers fails. Sider c...
International audienceWe use the logic of partial information to re-examine some early analyses of v...
Languages involving modalities and languages involving vagueness have each been thoroughly studied. ...
This paper deals with the question of what it is for a quantifier expression to be vague. First it d...
The semantic complexity of a quantifier can be defined as the computational complexity of the finite...
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...
PART I (Partial-valued Languages): In Chapter I we consider modes of sentence composition and ask wh...
Abstract: In Generalized Quantifier Semantics for Natural Language, as developed by Montague, Barwis...
Quantified expressions in natural language generally are taken to act like quantifiers in logic, whi...
Recent work in generalized quantifier theory has greatly increased our understanding of the types of...
This thesis presents experimental and computational modeling studies on the mental representations o...
Quantified terms are terms of generality. They are also provide some of our prime examples of the ph...
I here argue that Ted Sider's indeterminacy argument against vagueness in quantifiers fails. Sider c...
ing from the domain of discourse, we can say that determiner interpretations (henceforth: determiner...
I here argue that Ted Sider's indeterminacy argument against vagueness in quantifiers fails. Sider c...
International audienceWe use the logic of partial information to re-examine some early analyses of v...
Languages involving modalities and languages involving vagueness have each been thoroughly studied. ...
This paper deals with the question of what it is for a quantifier expression to be vague. First it d...
The semantic complexity of a quantifier can be defined as the computational complexity of the finite...
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...
PART I (Partial-valued Languages): In Chapter I we consider modes of sentence composition and ask wh...
Abstract: In Generalized Quantifier Semantics for Natural Language, as developed by Montague, Barwis...
Quantified expressions in natural language generally are taken to act like quantifiers in logic, whi...