The acceptability of _any_-DPs in existential modal sentences presents a challenge for theories of NPI licensing: existential modal sentences appear to differ substantially from other environments in which _any_-DPs are acceptable (in particular, they lack a downward-entailing operator). One approach to this challenge has been to, first, take _any_-DPs to be subject to an environment-based downward-entailingness condition—they have to occur in an environment that is Strawson downward-entailing with respect to their domain (cf. Kadmon and Landman 1993 )—and, second, to derive (...) such an environment in existential modal sentences by means of exhaustification (e.g., Fox 2007 ). This note presents new evidence for such a two-layered approach (cf. Crnič 2017, 2019 ). The evidence comes from a striking contrast in the behavior of singular vs. plural _any_-DPs in existential modal sentences. The paper concludes by charting some relations between _any_-DPs and other polarity items. (shrink)

Linguists often sharply distinguish the different modules that support linguistics competence, e.g., syntax, semantics, pragmatics. However, recent work has identified phenomena in syntax (polarity sensitivity) and pragmatics (implicatures), which seem to rely on semantic properties (monotonicity). We propose to investigate these phenomena and their connections as a window into the modularity of our linguistic knowledge. We conducted a series of experiments to gather the relevant syntactic, semantic and pragmatic judgments within a single paradigm. The comparison between these quantitative data leads (...) us to four main results, (i) Our results support a departure from one element of the classical Gricean approach, thus helping to clarify and settle an empirical debate. This first outcome also confirms the soundness of the methodology, as the results align with standard contemporary accounts of scalar implicature (SI), (ii) We confirm that the formal semantic notion of monotonicity underlies negative polarity item (NPI) syntactic acceptability, but (iii) our results indicate that the notion needed is perceived monotonicity. We see results (ii) and (iii) as the main contribution of this study: (ii) provides an empirical interpretation and confirmation of one of the insights of the model-theoretic approach to semantics, while (iii) calls for an incremental, cognitive implementation of the current generalizations, (iv) Finally, our results do not indicate that the relationship between NPI acceptability and monotonicity is mediated by pragmatic features related to Sis: this tells against elegant attempts to unify polarity sensitivity and Sis (pioneered by Krifka and Chierchia). These results illustrate a new methodology for integrating theoretically rigorous work in formal semantics with an experimentally-grounded cognitively-oriented view of linguistic competence. (shrink)

According to a simple theory of the relationship between 'want' ascriptions and the desires they ascribe, when I learn that ⌜A wants p⌝ is true, I learn that the truth of p is necessary and sufficient for satisfying one of A’s desires. I argue that this simple theory is false: ⌜A wants p⌝ can be true and underspecific: p may be necessary but not sufficient for the satisfaction of one of A’s desires. I show that existing semantics for 'want' cannot (...) account for this kind of underspecificity, and I propose a desire-based semantics for ‘want’ that can. I go on to argue that my semantics has empirical and methodological advantages over existing theories of ‘want’ that give truth conditions in terms of an agent’s preferential and doxastic state rather than their desires. -/- . (shrink)

In this paper, I offer a novel solution to the well-known problem concerning two polarity items in Korean, amu-(N)-to and amu-(N)-rato, that show a complementary distribution within the set of typical NPI-licensing contexts. I present a uniform analysis of the distribution of these NPIs, where the complementary distribution follows from the opposite scope properties of the emphatic particles to and rato contained in the NPIs in question. As the- oretical background, I adopt Karttunen and Peters’s (1979, Syntax and Semantics 11: (...) Presuppositions (pp. 1–56). New York: Academic Press) and Wilkinson’s (1996, Natural Language Semantics, 4, 193–215) scope analysis of even, Lahiri’s (1998, Natural Language Semantics, 6, 57–127) analysis of Hindi NPIs, and Guerzoni’s (2002, Proceedings of NELS 32 (pp. 153–170); GLSA, University of Massachusetts, Amherst, Mass.; 2004, Natural Language Semantics, 12, 319–343) analysis of the negative bias of yes/no-questions containing minimizers. The current analysis also lends further support to Guerzoni’s approach in that it bears out the prediction that in certain environments, a yes/no-question can be positively biased, i.e., only the positive answer is allowed as a legitimate answer in the context; this prediction was left unconfirmed in Guerzoni’s work. (shrink)

We describe a knowledge representation and inference formalism, based on an intensional propositional semantic network, in which variables are structures terms consisting of quantifier, type, and other information. This has three important consequences for natural language processing. First, this leads to an extended, more natural formalism whose use and representations are consistent with the use of variables in natural language in two ways: the structure of representations mirrors the structure of the language and allows re-use phenomena such as pronouns and (...) ellipsis. Second, the formalism allows the specification of description subsumption as a partial ordering on related concepts (variable nodes in a semantic network) that relates more general concepts to more specific instances of that concept, as is done in language. Finally, this structured variable representation simplifies the resolution of some representational difficulties with certain classes of natural language sentences, namely, donkey sentences and sentences involving branching quantifiers. The implementation of this formalism is called ANALOG (A NAtural LOGIC) and its utility for natural language processing tasks is illustrated. (shrink)

Branching quantifiers were first introduced by L. Henkin in his 1959 paper ‘Some Remarks on Infmitely Long Formulas’. By ‘branching quantifiers’ Henkin meant a new, non-linearly structured quantiiier-prefix whose discovery was triggered by the problem of interpreting infinitistic formulas of a certain form} The branching (or partially-ordered) quantifier-prefix is, however, not essentially infinitistic, and the issues it raises have largely been discussed in the literature in the context of finitistic logic, as they will be here. Our discussion transcends, however, the (...) resources of standard lst-order languages and we will consider the new form in the context of 1st-order logic with 1- and 2-place ‘Mostowskian` generalized quantifiers.2.. (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)

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)

This paper investigates how the distribution of negative polarity items can inform our understanding of the underlying semantic representation of constituent questions. It argues that the distribution of NPIs in questions is governed by the same logical properties that govern their distribution in declarative constructions. Building on an observation due to Guerzoni and Sharvit that strength of exhaustivity in questions correlates with the acceptability of NPIs, I propose a revision of the semantics of questions that can explain this link in (...) terms already familiar from the literature of negative polarity, namely the availability of a local downward entailing environment. I argue for a new theory of questions that takes strength of exhaustivity to be encoded internal to the question nucleus rather than in different answer-hood operators. This switch, while conceptually a simple move, has far-reaching consequences in the domain of questions. I also show how this new analysis can account for a host of issues related to NPIs, such as the subject–object asymmetry noted by Han and Siegel, the interaction between NPIs and high versus low wh-adjuncts, the varying acceptability of NPIs in the restrictor of which-phrases, and the contrast between weak and strong NPIs. (shrink)

Like Bennett's account of ‘even’, my analysis incorporates the following plausible and widespread intuitions. (a) The word ‘even’ does not make a truth-functional difference; it makes a difference only in conventional implicature. In particular, ‘even’ functions neither as a universal quantifier, nor a most or many quantifier. The only quantified statement that ‘Even A is F’ implies is the existential claim ‘There is an x (namely, A) that is F’, but this implication is nothing more than what the Equivalence Thesis (...) already demands. (b) ‘Even’ is epistemic in character, implying some type of unexpectedness, surprise, or unlikelihood. Moreover, despite Kay's arguments to the contrary, this implication is part of the meaning of ‘even’. (c) ‘Even’ is a scalar term, since unexpectedness comes in degrees. And, finally, (d) the felicity of an ‘even’-sentence S requires that S* be sufficiently surprising in comparison to its true neighbors. However,pace Bennett, being more surprising than just one true neighbor will not suffice. At the same time, being more surprising than all true neighbors is unnecessary. Suffice it that S* is more surprising than most true neighbors. (shrink)

The notion of measurement plays a central role in human cognition. We measure people’s height, the weight of physical objects, the length of stretches of time, or the size of various collections of individuals. Measurements of height, weight, and the like are commonly thought of as mappings between objects and dense scales, while measurements of collections of individuals, as implemented for instance in counting, are assumed to involve discrete scales. It is also commonly assumed that natural language makes use of (...) both types of scales and subsequently distinguishes between two types of measurements. This paper argues against the latter assumption. It argues that natural language semantics treats all measurements uniformly as mappings from objects (individuals or collections of individuals) to dense scales, hence the Universal Density of Measurement (UDM). If the arguments are successful, there are a variety of consequences for semantics and pragmatics, and more generally for the place of the linguistic system within an overall architecture of cognition. (shrink)

Jaakko Hintikka has argued that ordinary first-order logic should be replaced byindependence-friendly first-order logic, where essentially branching quantificationcan be represented. One recurring criticism of Hintikka has been that Hintikka'ssupposedly new logic is equivalent to a system of second-order logic, and henceis neither novel nor first-order. A standard reply to this criticism by Hintikka andhis defenders has been to show that given game-theoretic semantics, Hintikka'sbranching quantifiers receive the exact same treatment as the regular first-orderones. We develop a different reply, based around (...) considerations concerning thenature of logic. In particular, we argue that Hintikka's logic is the logic that bestrepresents the language fragment standard first-order logic is meantto represent. Therefore it earns its keep, and is also properly regarded as first-order. (shrink)

The Bounds of Logic presents a new philosophical theory of the scope and nature of logic based on critical analysis of the principles underlying modern Tarskian logic and inspired by mathematical and linguistic development. Extracting central philosophical ideas from Tarski’s early work in semantics, Sher questions whether these are fully realized by the standard first-order system. The answer lays the foundation for a new, broader conception of logic. By generally characterizing logical terms, Sher establishes a fundamental result in semantics. Her (...) development of the notion of logicality for quantifiers and her work on branching are of great importance for linguistics. Sher outlines the boundaries of the new logic and points out some of the philosophical ramifications of the new view of logic for such issues as the logicist thesis, ontological commitment, the role of mathematics in logic, and the metaphysical underpinning of logic. She proposes a constructive definition of logical terms, reexamines and extends the notion of branching quantification, and discusses various linguistic issues and applications. (shrink)