This paper examines the question of how so-called indeterminate phrases in Japanese (Kuroda 1965) associate with relevant particles higher in the structure. In the universal construction in Japanese, the restrictor (provided by an indeterminate phrase) sometimes appears to be separate from the universal particle mo. It is proposed that quantification at a distance is only apparent, and that the restriction is in fact provided locally by the sister constituent of mo as a whole. The proposal leads us to a straightforward (...) uniform picture of the syntax-semantics mapping of the universal construction and wh-questions, building upon Hamblin’s (1973) semantics for wh-phrases as sets of alternatives. It allows for a switch of perspective on a long-standing puzzle regarding locality effects in the indeterminate–particle association by deriving the locality pattern from the way indeterminate phrases are interpreted and associated with particles, without any stipulations. (shrink)

This paper gives a uniform account of the meaning of generalizations with explicit exceptions that employ the prepositions “but”, “except”, and “except for”. Our theory is that exceptives depend on generalizations, which can but need not be universal, whose generality they limit, and some of whose exceptions they comment on. Every generalization intrinsically partitions its domain of applicability into regular cases, which are as it says to expect, and exceptions, which are not. A generalization’s exceptions are instances that falsify it (...) if sufficiently prevalent. These two facts underpin the meaning of exceptives as combining a _generality claim_ with an _exception claim_, giving correct truth conditions for the several ways the three exceptive prepositions are used, and significantly improving on existing semantic accounts in the literature. We support this by analyzing a wide range of examples. The analysis applies whether or not the phrase following the exceptive preposition is a DP, and whether or not the generalization is expressed with a quantifier. We further argue that these exceptive prepositions are synonymous, contrary to the widely held view that a difference in meaning explains their different syntactic distributions. (shrink)

In this paper, I will argue for a new account of presuppositions which is based on double indexing as well as minimal representational contexts providing antecedent material for anaphoric presuppositions, rather than notions of context defined in terms of the interlocutors’ pragmatic presuppositions or the information accumulated from the preceding discourse. This account applies in particular to new phenomena concerning the presupposition of quantifier domains. But it is also intended to be an account of presuppositions in general. The account differs (...) from the Satisfaction Theory and the Binding Theory of presuppositions in that it can be viewed as a conservative extension of traditional static semantics and in that it does not involve the notion of pragmatic presupposition. (shrink)

Quantifiers in Language and Logic (QLL) is a major contribution to natural language semantics, specifically to quantification. It integrates the extensive recent work on quantifiers in logic and linguistics. It also presents new observations and results. QLL should help linguists understand the mathematical generalizations we can make about natural language quantification, and it should interest logicians by presenting an extensive array of quantifiers that lie beyond the pale of classical logic. Here we focus on those aspects of QLL we judge (...) to be of specific interest to linguists, and we contribute a few musings of our own, as one mark of a worthy publication is whether it stimulates the reader to seek out new observations, and QLL does. QLL is long and fairly dense, so we make no attempt to cover all the points it makes. But QLL has a topic index, a special symbols index and two tables of contents, a detailed one and an overview one, all of which help make it user friendly. QLL is presented in four parts: I, The Logical Conception of Quantifiers and Quantification with an introductory section Quantification . II, Quantifiers of Natural Language , the most extensive section in the book and of the most direct interest to linguists. III, Beginnings of a Theory of Expressiveness, Translation, and Formalization introduces notions of expressive power and definability, and IV, presents recent work and techniques concerning quantifier definability over finite domains, making accessible to linguists recent work in finite model theory. (shrink)

Quantifiers in Language and Logic (QLL) is a major contribution to natural language semantics, specifically to quantification. It integrates the extensive recent work on quantifiers in logic and linguistics. It also presents new observations and results. QLL should help linguists understand the mathematical generalizations we can make about natural language quantification, and it should interest logicians by presenting an extensive array of quantifiers that lie beyond the pale of classical logic. Here we focus on those aspects of QLL we judge (...) to be of specific interest to linguists, and we contribute a few musings of our own, as one mark of a worthy publication is whether it stimulates the reader to seek out new observations, and QLL does. QLL is long and fairly dense, so we make no attempt to cover all the points it makes. But QLL has a topic index, a special symbols index and two tables of contents, a detailed one and an overview one, all of which help make it user friendly. QLL is presented in four parts: I, "The Logical Conception of Quantifiers and Quantification" with an introductory section "Quantification". II, "Quantifiers of Natural Language", the most extensive section in the book and of the most direct interest to linguists. III, "Beginnings of a Theory of Expressiveness, Translation, and Formalization" introduces notions of expressive power and definability, and IV, presents recent work and techniques concerning quantifier definability over finite domains, making accessible to linguists recent work in finite model theory. (shrink)

This paper proposes that both weak and strong NPIs in English are sensitive to the downward entailingness of their licensers. It is also proposed, however, that these two types of NPIs pay attention to different aspects of the meaning of their environment. As observed by von Fintel and Chierchia, weak NPIs do not attend to the scalar implicatures of presuppositions of their licensers. Strong NPIs see both the truth-conditional and non-truth-conditional (scalar implications, presuppositions) meaning of their licensers. This theory accounts (...) for the puzzling inability, noted by Rullmann and Gajewski, of Strawson anti-additive operators to license strong NPIs, as well as for the effects of Zwarts’s hierarchy of negative strength. Additional issues concerning comparative quantifiers, few, and proportional quantifiers are addressed. (shrink)

This paper addresses two puzzles in the semantics of connected exceptive phrases (EP): (i) the compatibility of EPs modifying noun phrases headed by the negative polarity item (NPI) determiner any and (ii) the ability of a negative universal quantifier modified by an EP to license strong NPIs. Previous analyses of EPs are shown to fail to solve these puzzles. A new unified solution to the two puzzles is proposed. The crucial insight of the analysis is to allow von Fintel’s (Natural (...) Language Semantics 1: 123–148, 1993; Restrictions on quantifier domains, PhD dissertation, 1994) leastness condition on EPs to be imposed at scopes non-local to the surface position of the EP. A general result is derived concerning the truth conditions of sentences in which an existential modified by an EP occurs in the scope of a downward entailing operator. The distribution of EPs is argued to depend on how the leastness condition interacts with other pragmatic strengthening conditions, such as the one imposed on any by Kadmon and Landman (Linguistics and Philosophy 16: 353–422, 1993). (shrink)

This paper addresses the two interpretations that a combination ofnegative indefinites can get in concord languages like French:a concord reading, which amounts to a single negation, and a doublenegation reading. We develop an analysis within a polyadic framework,where a sequence of negative indefinites can be interpreted as aniteration of quantifiers or via resumption. The first option leadsto a scopal relation, interpreted as double negation. The secondoption leads to the construction of a polyadic negative quantifiercorresponding to the concord reading. Given that (...) sentential negationparticipates in negative concord, we develop an extension of thepolyadic approach which can deal with non-variable binding operators,treating the contribution of negation in a concord context assemantically empty. Our semantic analysis, incorporated into agrammatical analysis formulated in HPSG, crucially relies on theassumption that quantifiers can be combined in more than one wayupon retrieval from the quantifier store. We also considercross-linguistic variation regarding the participation ofsentential negation in negative concord. (shrink)

This paper addresses the two interpretations that a combination ofnegative indefinites can get in concord languages like French:a concord reading, which amounts to a single negation, and a doublenegation reading. We develop an analysis within a polyadic framework,where a sequence of negative indefinites can be interpreted as aniteration of quantifiers or via resumption. The first option leadsto a scopal relation, interpreted as double negation. The secondoption leads to the construction of a polyadic negative quantifiercorresponding to the concord reading. Given that (...) sentential negationparticipates in negative concord, we develop an extension of thepolyadic approach which can deal with non-variable binding operators,treating the contribution of negation in a concord context assemantically empty. Our semantic analysis, incorporated into agrammatical analysis formulated in HPSG, crucially relies on theassumption that quantifiers can be combined in more than one wayupon retrieval from the quantifier store. We also considercross-linguistic variation regarding the participation ofsentential negation in negative concord. (shrink)

This paper discusses two ways of negating DP quantifier phrases. In one way, NEG modifies the quantifier D directly with the structure [[NEG D] NP]. In the other way, NEG modifies the whole DP with the structure [NEG DP]. I give evidence based on negative polarity items that negated universal quantifier phrases like not every student involve outer negation.

When used next to a predicate at the extreme of a scale such as perfect, the exclusive modifiers just and simply convey a distinctive intensifying effect, presenting a puzzle for theories of exclusivity and alternative-based meanings more broadly. In this article, I develop an analysis of these modifiers as a special kind of alternative-targeting operator, whereby the speaker signals that more specific descriptions than the one they just asserted—modeled here as granularity-based alternatives—are not assertion-worthy in the context—i.e., they need not (...) be asserted in order for a complete representation of the facts to be provided. On this analysis, the intensifying effect of these modifiers are derived from the interaction of exclusivity, granularity, and the distinctive semantic properties of predicates denoting the extreme of a scalar extreme. More broadly, the proposal affords a jumping-off point for further work exploring the interaction between scalarity and exclusive operators, highlighting a number of intriguing lines of future research across semantics and pragmatics. (shrink)

Positive polarity items (PPIs) are generally thought to have the boring property that they cannot scope below negation. The starting point of the paper is the observation that their distribution is significantly more complex; specifically, someone/something-type PPIs share properties with negative polarity items (NPIs). First, these PPIs are disallowed in the same environments that license yet type NPIs; second, adding any NPI-licenser rescues the illegitimate constellation. This leads to the conclusion that these PPIs have the combined properties of yet-type and (...) ever-type NPIs: what appears to be a prohibition is nothing but “halfway licensing”. The paper goes on to propose a unification of the analyses of rescuable PPIs, NPIs, and negative concord, and questions the grounding of polarity sensitivity in the scalar or the referential semantics of the items involved. (shrink)

DP hypothesis of Abney (1987), the syntactic unit that had formerly been known as noun phrase should in fact be analyzed as a phrase headed by a determiner, hence the label DP. Quite independently of this syntactic development, Partee (1987) proposed a type shifting paradigm for the semantic analysis of nominals (now called DPs). In Partee's proposal DPs are ambiguous between a referential reading of type e, a predicative reading of type et and a quantificational reading of type (et)t. DP (...) meanings can flexibly move between their different readings due to covert application of semantic operators. The present paper proposes some strong relationships between these syntactic and semantic paradigms. It is argued that the structure of the DP affects its semantics in that the NP level within the DP is purely predicative and the DP level itself is purely quantificational. However, the intermediate D' level is flexible between the predicate/quantifier semantic categories, due to the covert application of semantic operators at this level. Partee's assumption, adopted from Discourse Representation Theory and more traditional approaches in philosophical logic, that some DPs need to have a (discourse) referential reading, is withdrawn. Instead of Partee's type shifting operators between the three semantic categories she assumes, two operators are used between predicates and quantifiers. The choice function operation of Reinhart (1997) and Winter (1997) is used as a general operator from predicates to quantifiers. The minimum operator of Winter (1996) is used as a general operator from quantifiers to predicates. These two operations, referred to as category shifting operators , account for most of the Partee data and substantially extend the theory of flexibility to treat some intricate phenomena in the domains of coordination, plurality and scope. (shrink)