We introduce generalized quantifiers, as defined in Tarskian semantics by Mostowski and Lindström, in logics whose semantics is based on teams instead of assignments, e.g., IF-logic and Dependence logic. Both the monotone and the non-monotone case is considered. It is argued that to handle quantifier scope dependencies of generalized quantifiers in a satisfying way the dependence atom in Dependence logic is not well suited and that the multivalued dependence atom is a better choice. This atom is in fact definably equivalent (...) to the independence atom recently introduced by Väänänen and Grädel. (shrink)

Ways of Scope Taking is concerned with syntactic, semantic and computational aspects of scope. Its starting point is the well-known but often neglected fact that different types of quantifiers interact differently with each other and other operators. The theoretical examination of significant bodies of data, both old and novel, leads to two central claims. (1) Scope is a by-product of a set of distinct Logical Form processes; each quantifier participates in those that suit its particular features. (2) Scope interaction is (...) further constrained by the semantics of the interacting operators. The arguments are developed using Minimalist syntax, Generalized Quantify theory, Discourse Representation Theory, and algebraic semantics. The contributors (Beghelli, Ben-Shalom, Doetjes, Farkas, Gutiérrez Rexach, Honcoop, Stabler, Stowell, Szabolcsi and Zwarts) make tightly related theoretical assumptions and focus on related empirical phenomena, which include the direct and inverse scope of quantifiers, distributivity, negation, modal and intensional contexts, weak islands, event-related readings, interrogatives, wh/quantifier interactions, and Hungarian syntax. An introduction to the formal semantics background is provided. Audience: Linguists, philosophers, computational and psycholinguists; advanced undergraduates, graduate students and researchers in these fields. (shrink)

While writing this thesis, there were many things I wanted to get right. I wanted to get the data right. I wanted to get my analysis of the data right. I certainly wanted to get all my citations right, which can get pretty tricky when one is trying to finish a chapter at 2am. But if an error did creep in somewhere in the body of the thesis, that is not a disaster. Sooner or later, I will get a chance (...) to correct it in a future publication. However, this part of the thesis, which sits right at the beginning but was among the last to be written, is different. I only have one opportunity to express, in print, how thankful I am to the people whose assistance was so important to me over the past years. Which is unfortunate, since if I were to truly elaborate all I am thankful for, these acknowledgements would be the lengthiest chapter of the thesis. But I hope this brief version will suffice in its stead. (shrink)

Survey of issues pertaining to the semantics of mass and plural nouns.

Following Henkin's discovery of partially-ordered (branching) quantification (POQ) with standard quantifiers in 1959, philosophers of language have attempted to extend his definition to POQ with generalized quantifiers. In this paper I propose a general definition of POQ with 1-place generalized quantifiers of the simplest kind: namely, predicative, or "cardinality" quantifiers, e.g., "most", "few", "finitely many", "exactly α", where α is any cardinal, etc. The definition is obtained in a series of generalizations, extending the original, Henkin definition first to a general (...) definition of monotone-increasing (M↑) POQ and then to a general definition of generalized POQ, regardless of monotonicity. The extension is based on (i) Barwise's 1979 analysis of the basic case of M↑ POQ and (ii) my 1990 analysis of the basic case of generalized POQ. POQ is a non-compositional Ist-order structure, hence the problem of extending the definition of the basic case to a general definition is not trivial. The paper concludes with a sample of applications to natural and mathematical languages. (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)

This paper proposes a formalization of the class of sentences quantified by most, which is also interpreted as proportion of or majority of depending on the domain of discourse. We consider sentences of the form “Most A are B”, where A and B are plural nouns and the interpretations of A and B are infinite subsets of \. There are two widely used semantics for Most A are B: \ > C \) and \ > \dfrac{C}{2} \), where C denotes (...) the cardinality of a given finite set X. Although is more descriptive than, it also produces a considerable amount of insensitivity for certain sets. Since the quantifier most has a solid cardinal behaviour under the interpretation majority and has a slightly more statistical behaviour under the interpretation proportional of, we consider an alternative approach in deciding quantity-related statements regarding infinite sets. For this we introduce a new semantics using natural density for sentences in which interpretations of their nouns are infinite subsets of \, along with a list of the axiomatization of the concept of natural density. In other words, we take the standard definition of the semantics of most but define it as applying to finite approximations of infinite sets computed to the limit. (shrink)

Recent work on the acquisition of number words has emphasized the importance of integrating linguistic and developmental perspectives [Musolino, J. (2004). The semantics and acquisition of number words: Integrating linguistic and developmental perspectives. Cognition93, 1-41; Papafragou, A., Musolino, J. (2003). Scalar implicatures: Scalar implicatures: Experiments at the semantics-pragmatics interface. Cognition, 86, 253-282; Hurewitz, F., Papafragou, A., Gleitman, L., Gelman, R. (2006). Asymmetries in the acquisition of numbers and quantifiers. Language Learning and Development, 2, 76-97; Huang, Y. T., Snedeker, J., Spelke, (...) L. (submitted for publication). What exactly do numbers mean?]. Specifically, these studies have shown that data from experimental investigations of child language can be used to illuminate core theoretical issues in the semantic and pragmatic analysis of number terms. In this article, I extend this approach to the logico-syntactic properties of number words, focusing on the way numerals interact with each other (e.g. Three boys are holding two balloons) as well as with other quantified expressions (e.g. Three boys are holding each balloon). On the basis of their intuitions, linguists have claimed that such sentences give rise to at least four different interpretations, reflecting the complexity of the linguistic structure and syntactic operations involved. Using psycholinguistic experimentation with preschoolers (n=32) and adult speakers of English (n=32), I show that (a) for adults, the intuitions of linguists can be verified experimentally, (b) by the age of 5, children have knowledge of the core aspects of the logical syntax of number words, (c) in spite of this knowledge, children nevertheless differ from adults in systematic ways, (d) the differences observed between children and adults can be accounted for on the basis of an independently motivated, linguistically-based processing model [Geurts, B. (2003). Quantifying kids. Language Acquisition, 11(4), 197-218]. In doing so, this work ties together research on the acquisition of the number vocabulary with a growing body of work on the development of quantification and sentence processing abilities in young children [Geurts, 2003; Lidz, J., Musolino, J. (2002). Children's command of quantification. Cognition, 84, 113-154; Musolino, J., Lidz, J. (2003). The scope of isomorphism: Turning adults into children. Language Acquisition, 11(4), 277-291; Trueswell, J., Sekerina, I., Hilland, N., Logrip, M. (1999). The kindergarten-path effect: Studying on-line sentence processing in young children. Cognition, 73, 89-134; Noveck, I. (2001). When children are more logical than adults: Experimental investigations of scalar implicature. Cognition, 78, 165-188; Noveck, I., Guelminger, R., Georgieff, N., & Labruyere, N. (2007). What autism can tell us about every. . . not sentences. Journal of Semantics,24(1), 73-90. On a more general level, this work confirms the importance of integrating formal and developmental perspectives [Musolino, 2004], this time by highlighting the explanatory power of linguistically-based models of language acquisition and by showing that the complex structure postulated by linguists has important implications for developmental accounts of the number vocabulary. (shrink)

We study the computational complexity of polyadic quantifiers in natural language. This type of quantification is widely used in formal semantics to model the meaning of multi-quantifier sentences. First, we show that the standard constructions that turn simple determiners into complex quantifiers, namely Boolean operations, iteration, cumulation, and resumption, are tractable. Then, we provide an insight into branching operation yielding intractable natural language multi-quantifier expressions. Next, we focus on a linguistic case study. We use computational complexity results to investigate semantic (...) distinctions between quantified reciprocal sentences. We show a computational dichotomy<br>between different readings of reciprocity. Finally, we go more into philosophical speculation on meaning, ambiguity and computational complexity. In particular, we investigate a possibility to<br>revise the Strong Meaning Hypothesis with complexity aspects to better account for meaning shifts in the domain of multi-quantifier sentences. The paper not only contributes to the field of the formal<br>semantics but also illustrates how the tools of computational complexity theory might be successfully used in linguistics and philosophy with an eye towards cognitive science. (shrink)

This chapter offers a logical, linguistic, and philosophical account of modern quantification theory. Contrasting the standard approach to quantifiers (according to which logical quantifiers are defined by enumeration) with the generalized approach (according to which quantifiers are defined systematically), the chapter begins with a brief history of standard quantifier theory and identifies some of its logical, linguistic, and philosophical strengths and weaknesses. It then proceeds to a brief history of generalized quantifier theory and explains how it overcomes the weaknesses of (...) the standard theory. One of the main philosophical advantages of the generalized theory is its philosophically informative criterion of logicality. The chapter describes the work done so far in this theory, highlights some of its central logical results, offers an overview of its main linguistic contributions, and discusses its philosophical significance. (shrink)

In the literature on logics of imperfect information it is often stated, incorrectly, that the Game-Theoretical Semantics of Independence-Friendly quantifiers captures the idea that the players of semantical games are forced to make some moves without knowledge of the moves of other players. We survey here the alternative semantics for IF logic that have been suggested in order to enforce this “epistemic reading” of sentences. We introduce some new proposals, and a more general logical language which distinguishes between “independence from (...) actions” and “independence from strategies”. New semantics for IF logic can be obtained by choosing embeddings of the set of IF sentences into this larger language. We compare all the semantics proposed and their purported game-theoretical justifications, and disprove a few claims that have been made in the literature. (shrink)

Since Fodor 1970, negation has worn a Homogeneity Condition to the effect that homogeneous predicates, ) denote homogeneously—all or nothing —to characterize the meaning of – when uttered out-of-the blue, in contrast to –:The mirrors are smooth. The mirrors are not smooth. The mirrors circle the telescope’s reflector. The mirrors do not circle the telescope’s reflector. It has been a problem for philosophical logic and for the semantics of natural language that – appear to defy the Principle of Excluded Middle (...) while – do not—Smooth ¬Smooth Circle ¬Circle. An impoverished logical form – has been the occasion to embellish all else—Boolean algebra, lexical presuppositions, Strongest Meaning Hypothesis, trivalence, supervaluation, double strengthening, etc., enriching the semantics and pragmatics with what remains a special theory of negation, which may be dismissed when the logical syntax and semantics of negation reflects that negated sentences are also tensed sentences. (shrink)

In this paper I examine a cluster of concepts relevant to the methodology of truth theories: 'informative definition', 'recursive method', 'semantic structure', 'logical form', 'compositionality', etc. The interrelations between these concepts, I will try to show, are more intricate and multi-dimensional than commonly assumed.

The goal of this dissertation is twofold. First, we aim to identify the source of distributivity in natural language. Our hypothesis is that throughout the grammar, distributivity can be tracked down to a single operator. Two converging lines of reasoning help us identify this operator. One line emerges as a result of generalizing and unifying previously disparate treatments of distributivity in the domain of nominal quantifiers. The other line comes from analyzing the meaning of durative adverbials, with special attention to (...) their interaction with cumulative readings. Second, we aim to provide a unified formal semantic framework for the treatment of interactions between verbs and their arguments, most importantly aspect, plurality, and quantification, and to shed light on the way in which thematic arguments are associated with the verb in the lexicon and in the compositional process. Although existing frameworks deal with parts of this picture, no such unified framework exists to date. The theoretical results presented in this proposal include a novel argument in favor of a quantificational analysis of durative adverbials (Dowty, 1979; Moltmann, 1991); a novel account of cumulativity and distributivity that covers both the two-quantifier and three-quantifier case in the nominal domain, including readings prominently discussed by Schein (1993); a reason for severing not only the external, but also the internal argument from the semantics of the verb, in response to Kratzer (1996); and the first event-based semantics for Tree-adjoining grammar (TAG, Joshi et al., 1975). (shrink)

Next SectionWe discuss the thesis formulated by Hintikka (1973) that certain natural language sentences require non-linear quantification to express their meaning. We investigate sentences with combinations of quantifiers similar to Hintikka's examples and propose a novel alternative reading expressible by linear formulae. This interpretation is based on linguistic and logical observations. We report on our experiments showing that people tend to interpret sentences similar to Hintikka sentence in a way consistent with our interpretation.

In this paper, we axiomatize modal logic extended with the modal operator $$M\varphi $$ saying that “there are strictly more $$\varphi $$ -successors than $$\lnot \varphi $$ -successors”, both in the class of image-finite Kripke frames and in the class of all Kripke frames. We follow the proof strategy of van der Hoek (Int J Uncertain Fuzziness Knowl Based Syst 4(1):45–60, 1996.), and prove a characterization result of finite majority structures which are capable of representing finite cardinality measures and a (...) characterization result of finite extended majority structures which are capable of representing cardinality measures. (shrink)

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, (...) Dordrecht, 1996) as the best proposal so far to deal with these readings. Then, it incorporates its insights in the logical framework defined in Robaldo (J Philos Log 39(1):23–58, 2009a), leading to a scalable logical account for NL quantification. (shrink)

Bare plurals (dogs) behave in ways that quantified plurals (some dogs) do not. For instance, while the sentence John owns dogs implies that John owns more than one dog, its negation John does not own dogs does not mean “John does not own more than one dog”, but rather “John does not own a dog”. A second puzzling behavior is known as the dependent plural reading; when in the scope of another plural, the ‘more than one’ meaning of the plural (...) is not distributed over, but the existential force of the plural is. For example, My friends attend good schools requires that each of my friends attend one good school, not more, while at the same time being inappropriate if all my friends attend the same school. This paper shows that both these phenomena, and others, arise from the same cause. Namely, the plural noun itself does not assert ‘more than one’, but rather the plural denotes a predicate that is number neutral (unspecified for cardinality). The ‘more than one’ meaning arises as an scalar implicature, relying on the scalar relationship between the bare plural and its singular alternative, and calculated in a sub-sentential domain; namely, before existential closure of the event variable. Finally, implications of this analysis will be discussed for the analysis of the quantified noun phrases that interact with bare plurals, such as indefinite numeral DPs (three boys), and singular universals (every boy). (shrink)

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 (...) made in Sher (J Philos Logic 26:1–43, 1997 ) in order to properly represent the meaning of IS readings involving NL quantifiers. The solution proposed here allows to uniformly deal with both standard linear and IS readings, regardless of their actual existence in NL or quantifiers’ monotonicity. Sentences featuring nested quantifications are particularly problematic. By avoiding parallel nested quantification in the formulae, the proper true values are achieved. (shrink)

We give a condensed survey of recent research on generalized quantifiers in logic, linguistics and computer science, under the following headings: Logical definability and expressive power, Polyadic quantifiers and linguistic definability, Weak semantics and axiomatizability, Computational semantics, Quantifiers in dynamic settings, Quantifiers and modal logic, Proof theory of generalized quantifiers.

Natural language sentences that talk about two or more sets of entities can be assigned various readings. The ones in which the sets are independent of one another are particularly challenging from the formal point of view. In this paper we will call them ‘Independent Set (IS) readings’. Cumulative and collective readings are paradigmatic examples of IS readings. Most approaches aiming at representing the meaning of IS readings implement some kind of maximality conditions on the witness sets involved. Two kinds (...) of maximization have been proposed in the literature: ‘Local’ and ‘Global’ maximization. In this paper, we present an online questionnaire whose results appear to support Local maximization. The latter seems to capture the proper interplay between the semantics and the pragmatics of multi-quantifier sentences, provided that witness sets are selected on pragmatic grounds. (shrink)